Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Efficient implementation of a BDD package
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Building problem solvers
Knowledge compilation and theory approximation
Journal of the ACM (JACM)
GRASP—a new search algorithm for satisfiability
Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
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
Branching programs and binary decision diagrams: theory and applications
Branching programs and binary decision diagrams: theory and applications
A machine program for theorem-proving
Communications of the ACM
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Symbolic Model Checking
Algorithms and Data Structures in VLSI Design
Algorithms and Data Structures in VLSI Design
Efficient conflict driven learning in a boolean satisfiability solver
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
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
Applying SAT Methods in Unbounded Symbolic Model Checking
CAV '02 Proceedings of the 14th International Conference on Computer Aided Verification
The Quest for Efficient Boolean Satisfiability Solvers
CADE-18 Proceedings of the 18th International Conference on Automated Deduction
A compiler for deterministic, decomposable negation normal form
Eighteenth national conference on Artificial intelligence
BerkMin: A Fast and Robust Sat-Solver
Proceedings of the conference on Design, automation and test in Europe
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
DNNF-based belief state estimation
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Compilation of query-rewriting problems into tractable fragments of propositional logic
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
Propositional fragments for knowledge compilation and quantified boolean formulae
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
On compiling system models for faster and more scalable diagnosis
AAAI'05 Proceedings of the 20th national conference on Artificial intelligence - Volume 1
Journal of Artificial Intelligence Research
The good old Davis-Putnam procedure helps counting models
Journal of Artificial Intelligence Research
Hierarchical diagnosis of multiple faults
IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
An analysis of approximate knowledge compilation
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
Knowledge compilation using theory prime implicates
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
AND/OR branch-and-bound for graphical models
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Model compilation for real-time planning and diagnosis with feedback
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Compiling Bayesian networks with local structure
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Compiling relational Bayesian networks for exact inference
International Journal of Approximate Reasoning
Aligning CNF- and equivalence-reasoning
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Using DPLL for efficient OBDD construction
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Heuristics for fast exact model counting
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
DPLL+ROBDD Derivation applied to inversion of some cryptographic functions
SAT'11 Proceedings of the 14th international conference on Theory and application of satisfiability testing
Distributed tree decomposition with privacy
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
| Hi-index | 0.00 |
This paper is concerned with a class of algorithms that perform exhaustive search on propositional knowledge bases. We show that each of these algorithms defines and generates a propositional language. Specifically, we show that the trace of a search can be interpreted as a combinational circuit, and a search algorithm then defines a propositional language consisting of circuits that are generated across all possible executions of the algorithm. In particular, we show that several versions of exhaustive DPLL search correspond to such well-known languages as FBDD, OBDD, and a precisely-defined subset of d-DNNF. By thus mapping search algorithms to propositional languages, we provide a uniform and practical framework in which successful search techniques can be harnessed for compilation of knowledge into various languages of interest, and a new methodology whereby the power and limitations of search algorithms can be understood by looking up the tractability and succinctness of the corresponding propositional languages.