A Perspective on Knowledge Compilation

We provide 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 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, which we show to include a relatively large number of target compilation languages.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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