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
|
2317
|
Graph-Based Algorithms for Boolean Function Manipulation
– Bryant
- 1986
|
|
1588
|
Computational Complexity
– Papadimitriou
- 1994
|
|
724
|
Symbolic boolean manipulation with Ordered Binary Decision Diagrams
– Bryant
- 1992
|
|
304
|
The complexity of Boolean functions
– Wegener
- 1987
|
|
256
|
Truth maintenance systems
– Kleer, Harris
- 1979
|
|
195
|
Some connections between nonuniform and uniform complexity classes
– Karp, Lipton
- 1980
|
|
123
|
A way to simplify truth functions
– Quine
- 1955
|
|
121
|
On the hardness of approximate reasonning
– Roth
- 1996
|
|
106
|
Knowledge compilation and theory approximation
– Selman, Kautz
- 1996
|
|
83
|
Directional resolution: The Davis-Putnam procedure, revisited
– Dechter, Rish
- 1994
|
|
77
|
A survey on knowledge compilation
– Cadoli, Donini
- 1997
|
|
64
|
Planning via model checking: A decision procedure for AR
– Cimatti, Giunchiglia, et al.
- 1997
|
|
55
|
Learning to reason
– Khardon, Roth
- 1997
|
|
52
|
Decomposable negation normal form
– Darwiche
|
|
51
|
Equivalence of free Boolean graphs can be decided probabilistically
– Blum, Chandra, et al.
- 1980
|
|
49
|
The comparitive linguistics of knowledge representations
– Gogic, Kautz, et al.
- 1995
|
|
41
|
Forget it
– LIN, REITER
- 1994
|
|
40
|
Knowledge compilation using theory prime implicates
– Marquis
- 1995
|
|
36
|
Efficient analysis and manipulation of OBDDs can be extended to FBDDs
– Gergov, Meinel
- 1994
|
|
30
|
Compiling knowledge into decomposable negation normal form
– DARWICHE
- 1999
|
|
28
|
An improved incremental algorithm for generating prime implicates
– Kleer
- 1992
|
|
26
|
Tractable databases: How to make propositional unit resolution complete through compilation
– VAL, A
- 1994
|
|
24
|
On cores and prime implicants of truth functions
– Quine
- 1959
|
|
24
|
Space efficiency of propositional knowledge representation formalisms
– Cadoli, Donini, et al.
- 1996
|
|
22
|
On the tractability of counting theory models and its application to belief revision and truth maintenance
– Darwiche
- 2001
|
|
22
|
Propositional belief base update and minimal change
– Herzig, Rifi
- 1999
|
|
17
|
On the number of prime implicants
– Chandra, Markowsky
- 1978
|
|
15
|
Tractable cover compilations
– BOUFKHAD, GREGOIRE, et al.
- 1997
|
|
12
|
Compilation for critically constrained knowledge bases
– Schrag
- 1996
|
|
12
|
Efficient consequence finding
– Simon, Val
- 2001
|
|
9
|
A new method to compute prime and essential prime implicants of boolean functions
– Coudert, Madre
- 1992
|
|
8
|
Meinel: Analysis and Manipulation of Boolean Functions in Terms of Decision Graphs
– Gergov, Ch
- 1992
|
|
6
|
An investigation of the laws of thought. Walton and Maberley
– Boole
- 1854
|
|
6
|
Comparing space e#ciency of propositional knowledge representation formalisms
– Cadoli, Donini, et al.
- 1996
|
|
4
|
Testing equivalence probabilistically
– Darwiche, Huang
|
|
3
|
Ecient analysis and manipulation of OBDDs can be extended to FBDDs
– Gergov, Meinel
- 1994
|
|
2
|
The comparative linguistics of knowledge representation
– Papadimitriou, Selman
- 1995
|
|
2
|
Propositional independence - part I: formula-variable independence and forgetting
– Lang, Liberatore, et al.
- 2000
|
|
1
|
Propositional independence—Part I: formula–variable independence and forgetting
– Lang, Liberatore
- 2000
|
|
1
|
Consequence finding algorithms, Vol. 5 of Handbook of Defeasible Reasoning and Uncertainty Management Systems: Algorithms for Uncertain and Defeasible Reasoning
– Marquis
- 2000
|
|
1
|
Consequence finding algorithms, volume 5, ”Algorithms for Uncertain and Defeasible Reasoning” of Handbook of Defeasible Reasoning and Uncertainty Management Systems
– Marquis
- 2000
|
|
1
|
n i=1 xi has only one model over �n i=1 {xi} but its negation ¬Σ has 2n − 1 models over �n i=1 {xi}. Hence MODS cannot satisfy
– unknown authors
- 1997
|
