Updating Reduced Implicate Tries

The reduced implicate trie, introduced in [11], is a data structure that may be used as a target language for knowledge compilation. It has the property that, even when large, it guarantees fast response to queries. Specifically, a query can be processed in time linear in the size of the queryregardless of the size of the compiled knowledge base. The knowledge compilation paradigm typically assumes that the "intractable part" of the processing be done once, during compilation. This assumption could render updating the knowledge base infeasible if recompilation is required. The ability to install updates without recompilation may therefore considerably widen applicability. In this paper, several update operations not requiring recompilation are developed. These include disjunction, substitution of truth constants, conjunction with unit clauses, reordering of variables, and conjunction with clauses.

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

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

[3]  Pierre Marquis,et al.  A Knowledge Compilation Map , 2002, J. Artif. Intell. Res..

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

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

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

[7]  Reiner Hähnle,et al.  Normal Forms for Knowledge Compilation , 2005, ISMIS.

[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]  Alex Kean,et al.  An Incremental Method for Generating Prime Implicants/Impicates , 1990, J. Symb. Comput..

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

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

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

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

[14]  Michael M. Richter,et al.  Processing Declarative Knowledge: International Workshop PDK '91, Kaiserslautern, Germany, July 1-3, 1991. Proceedings , 1991 .

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

[16]  Bart Selman,et al.  A General Framework for Knowledge Compilation , 1991, PDK.

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

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

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

[20]  Shusaku Tsumoto,et al.  Foundations of Intelligent Systems, 15th International Symposium, ISMIS 2005, Saratoga Springs, NY, USA, May 25-28, 2005, Proceedings , 2005, ISMIS.

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

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

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