A New Algorithm for Incremental Prime Implicate Generation

Abstract

Traditional algorithms for prime implicate generation [Quine, 1952; McCluskey, 1956; Tison, 1967; Kean and Tsiknis, 1990; de Kleer, 1992] require the input formulas to be first transformed into a CNF formula. This process, however, requires exponential time in the worst case and can result in an exponential blow up of the input size. Such cases occur frequently when the problem domains are best characterized by some DNF formulas. In this paper, we study a new algorithm which allows a more general input: a conjunction of DNF formulas. We wil l present empirical results comparing the new algorithm with some existing implementations, and discuss how it can be used in a propositional abductive reasoning system.

Extracted Key Phrases

Statistics

0510'97'99'01'03'05'07'09'11'13'15'17
Citations per Year

61 Citations

Semantic Scholar estimates that this publication has 61 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Ngair1993ANA, title={A New Algorithm for Incremental Prime Implicate Generation}, author={Teow-Hin Ngair}, booktitle={IJCAI}, year={1993} }