{"type":"ScholarlyArticle","title":"A New Algorithm for Incremental Prime Implicate Generation","authors":[{"name":"Teow-Hin Ngair","slug":"teow-hin-ngair","given":"Teow-Hin","family":"Ngair","affiliation":""}],"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 ofDNF formulas. We will present empirical results comparing the new algorithm with some existing implementations, and discuss how it can be used in a propositional abductive reasoning system.","doi":null,"url":"https://ijcai.org/proceedings/1993/7","pdf":"https://ijcai.org/proceedings/1993/0007.pdf","markdown":"https://ijcai.org/proceedings/1993/7.md","bibtex":"https://ijcai.org/proceedings/1993/bibtex/7","volume":{"slug":"1993","title":"Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1993","url":"https://ijcai.org/proceedings/1993/","year":1993,"location":"Chambéry, France","dates":"","editors":"Ruzena Bajcsy","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Automated Reasoning","track":"Automated Reasoning","number":7,"pages":{"first":46,"last":50},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}