Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
Using caching to solve larger probabilistic planning problems
AAAI '98/IAAI '98 Proceedings of the fifteenth national/tenth conference on Artificial intelligence/Innovative applications of artificial intelligence
A machine program for theorem-proving
Communications of the ACM
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Decomposable negation normal form
Journal of the ACM (JACM)
Faster SAT and smaller BDDs via common function structure
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Efficient Boolean Manipulation with OBDD's Can be Extended to FBDD's
IEEE Transactions on Computers
Counting Models Using Connected Components
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
A compiler for deterministic, decomposable negation normal form
Eighteenth national conference on Artificial intelligence
Algorithms and Complexity Results for #SAT and Bayesian Inference
FOCS '03 Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science
Mixtures of deterministic-probabilistic networks and their AND/OR search space
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
A survey on knowledge compilation
AI Communications
Journal of Artificial Intelligence Research
Knowledge compilation using theory prime implicates
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Using DPLL for efficient OBDD construction
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
AND/OR search spaces for graphical models
Artificial Intelligence
On probabilistic inference by weighted model counting
Artificial Intelligence
AND/OR Multi-valued Decision Diagrams for Constraint Networks
Concurrency, Graphs and Models
Approximate Compilation of Constraints into Multivalued Decision Diagrams
CP '08 Proceedings of the 14th international conference on Principles and Practice of Constraint Programming
Literal Projection for First-Order Logic
JELIA '08 Proceedings of the 11th European conference on Logics in Artificial Intelligence
Using more reasoning to improve #SAT solving
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Knowledge compilation properties of tree-of-BDDs
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
AND/OR multi-valued decision diagrams (AOMDDs) for graphical models
Journal of Artificial Intelligence Research
Tableaux for Projection Computation and Knowledge Compilation
TABLEAUX '09 Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods
Compiling relational Bayesian networks for exact inference
International Journal of Approximate Reasoning
Knowledge Compilation Using Interval Automata and Applications to Planning
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Interactive cost configuration over decision diagrams
Journal of Artificial Intelligence Research
Compiling constraint networks into AND/OR multi-valued decision diagrams (AOMDDs)
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Encoding CNFs to empower component analysis
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Projection and scope-determined circumscription
Journal of Symbolic Computation
Dsharp: fast d-DNNF compilation with sharpSAT
Canadian AI'12 Proceedings of the 25th Canadian conference on Advances in Artificial Intelligence
Hi-index | 0.00 |
We show that the trace of an exhaustive DPLL search can be viewed as a compilation of the propositional theory. With different constraints imposed or lifted on the DPLL algorithm, this compilation will belong to the language of d-DNNF, FBDD, and OBDD, respectively. These languages are decreasingly succinct, yet increasingly tractable, supporting such polynomial-time queries as model counting and equivalence testing. Our contribution is thus twofold. First, we provide a uniform framework, supported by empirical evaluations, for compiling knowledge into various languages of interest. Second, we show that given a particular variant of DPLL, by identifying the language membership of its traces, one gains a fundamental understanding of the intrinsic complexity and computational power of the search algorithm itself. As interesting examples, we unveil the "hidden power" of several recent model counters, point to one of their potential limitations, and identify a key limitation of DPLL-based procedures in general.