A Knowledge Compilation Map

We propose a perspective on knowledge compilation which calls for analyzing different compilation approaches according to two key dimensions: the succinctness of the target compilation language, and the class of queries and transformations that the language supports in polytime. We then provide a knowledge compilation map, which analyzes a large number of existing target compilation languages according to their succinctness and their polytime transformations and queries. We argue that such analysis is necessary for placing new compilation approaches within the context of existing ones. We also go beyond classical, flat target compilation languages based on CNF and DNF, and consider a richer, nested class based on directed acyclic graphs (such as OBDDs), which we show to include a relatively large number of target compilation languages.

[1]  Willard Van Orman Quine,et al.  A Way to Simplify Truth Functions , 1955 .

[2]  Johan de Kleer.  An Improved Incremental Algorithm for Generating Prime Implicates , 1992, AAAI.

[3]  Andreas Herzig,et al.  Propositional Belief Base Update and Minimal Change , 1999, Artif. Intell..

[4]  Robert Schrag,et al.  Compilation for Critically Constrained Knowledge Bases , 1996, AAAI/IAAI, Vol. 1.

[5]  Dan Roth,et al.  Learning to reason , 1994, JACM.

[6]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[7]  Francesco M. Donini,et al.  Comparing Space Efficiency of Propositional Knowledge Representation Formalisms , 1996, KR.

[8]  Prof. Dr. Christoph Meinel,et al.  Algorithms and Data Structures in VLSI Design , 1998, Springer Berlin Heidelberg.

[9]  Bart Selman,et al.  The Comparative Linguistics of Knowledge Representation , 1995, IJCAI.

[10]  Bart Selman,et al.  Knowledge compilation and theory approximation , 1996, JACM.

[11]  George Markowsky,et al.  On the number of prime implicants , 1978, Discret. Math..

[12]  Adnan Darwiche.  Compiling Knowledge into Decomposable Negation Normal Form , 1999, IJCAI.

[13]  Fausto Giunchiglia,et al.  Planning via Model Checking: A Decision Procedure for AR , 1997, ECP.

[14]  R. Reiter,et al.  Forget It ! , 1994 .

[15]  Olivier Coudert,et al.  A new method to compute prime and essential prime implicants of Boolean functions , 1992 .

[16]  Christoph Meinel,et al.  Efficient Boolean Manipulation With OBDD's can be Extended to FBDD's , 1994, IEEE Trans. Computers.

[17]  George Boole,et al.  An Investigation of the Laws of Thought: Frontmatter , 2009 .

[18]  Christoph Meinel,et al.  Algorithms and Data Structures in VLSI Design: OBDD - Foundations and Applications , 2012 .

[19]  Manuel Blum,et al.  Equivalence of Free Boolean Graphs can be Decided Probabilistically in Polynomial Time , 1980, Inf. Process. Lett..

[20]  Alvaro del Val.  Tractable Databases: How to Make Propositional Unit Resolution Complete Through Compilation , 1994, KR.

[21]  Rina Dechter,et al.  Directional Resolution: The Davis-Putnam Procedure, Revisited , 1994, KR.

[22]  Jürg Kohlas,et al.  Handbook of Defeasible Reasoning and Uncertainty Management Systems , 2000 .

[23]  Richard J. Lipton,et al.  Some connections between nonuniform and uniform complexity classes , 1980, STOC '80.

[24]  Ingo Wegener,et al.  The complexity of Boolean functions , 1987 .

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

[26]  Laurent Simon,et al.  Efficient Consequence Finding , 2001, IJCAI.

[27]  Christoph Meinel,et al.  On the Complexity of Analysis and Manipulation of Boolean Functions in Terms of Decision Graphs , 1994, Inf. Process. Lett..

[28]  Randal E. Bryant,et al.  Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

[29]  Adnan Darwiche,et al.  Decomposable negation normal form , 2001, JACM.

[30]  Marco Cadoli,et al.  A Survey on Knowledge Compilation , 1997, AI Commun..

[31]  Adnan Darwiche,et al.  Testing Equivalence Probabilistically , 2002 .

[32]  W. Quine.  On Cores and Prime Implicants of Truth Functions , 1959 .

[33]  Pierre Marquis,et al.  Knowledge Compilation Using Theory Prime Implicates , 1995, IJCAI.

[34]  Adnan Darwiche.  On the tractable counting of theory models and its application to belief revision and truth maintenance , 2000, ArXiv.

[35]  Lakhdar Sais,et al.  Tractable Cover Compilations , 1997, IJCAI.

[36]  Dan Roth,et al.  On the Hardness of Approximate Reasoning , 1993, IJCAI.