Prime Implicate Tries

The prime implicate trie (pi -trie) of a logical formula is a tree whose branches are labeled with the prime implicates of the formula. The technology of reduced implicate tries is employed to analyze the structure of pi -tries. Appropriate lemmas and theorems are proved, and an algorithm that builds the pi -trie from a logical formula is developed. Preliminary experimental results are presented.

[1]  Teow-Hin Ngair,et al.  A New Algorithm for Incremental Prime Implicate Generation , 1993, IJCAI.

[2]  Frank van Harmelen,et al.  Extensions to the Rippling-Out Tactic for Guiding Inductive Proofs , 1990, CADE.

[3]  Neil V. Murray,et al.  Efficient Query Processing with Reduced Implicate Tries , 2006, Journal of Automated Reasoning.

[4]  Teodor C. Przymusinski.  An Algorithm to Compute Circumscription , 1989, Artif. Intell..

[5]  Tadeusz Strzemecki,et al.  Polynomial-time algorithms for generation of prime implicants , 1992, J. Complex..

[6]  George Becker,et al.  CNF and DNF Considered Harmful for Computing Prime Implicants/Implicates , 2004, Journal of Automated Reasoning.

[7]  Donald R. Morrison,et al.  PATRICIA—Practical Algorithm To Retrieve Information Coded in Alphanumeric , 1968, J. ACM.

[8]  Olivier Coudert,et al.  Implicit and incremental computation of primes and essential primes of Boolean functions , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[9]  Peter Jackson,et al.  Computing Prime Implicates Incrementally , 1992, CADE.

[10]  Peter Jackson,et al.  Computing prime implicates , 1992, CSC '92.

[11]  Vasco M. Manquinho,et al.  Prime implicant computation using satisfiability algorithms , 1997, Proceedings Ninth IEEE International Conference on Tools with Artificial Intelligence.

[12]  Raymond Reiter,et al.  Foundations of Assumption-based Truth Maintenance Systems: Preliminary Report , 1987, AAAI.

[13]  Roy Dyckhoff.  Automated Reasoning with Analytic Tableaux and Related Methods , 2000, Lecture Notes in Computer Science.

[14]  Alex Kean,et al.  ASSUMPTION‐BASED REASONING AND CLAUSE MANAGEMENT SYSTEMS , 1990, Comput. Intell..

[15]  Alex Kean,et al.  An Incremental Method for Generating Prime Implicants/Impicates , 1990, J. Symb. Comput..

[16]  Peter Jackson,et al.  Computing Prime Implicants , 1990, CADE.

[17]  Richard C. T. Lee,et al.  A New Algorithm for Generating Prime Implicants , 1970, IEEE Transactions on Computers.

[18]  Toby Walsh,et al.  Automated Deduction—CADE-11 , 1992, Lecture Notes in Computer Science.

[19]  Neil V. Murray,et al.  Efficient Query Processing with Compiled Knowledge Bases , 2005, TABLEAUX.

[20]  Neil V. Murray,et al.  Updating Reduced Implicate Tries , 2007, TABLEAUX.

[21]  Guilherme Bittencourt.  Combining Syntax and Semantics through Prime Form Representation , 2008, J. Log. Comput..