Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
The vertex separation number of a graph equals its path-width
Information Processing Letters
A machine program for theorem-proving
Communications of the ACM
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
Counting Models Using Connected Components
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
A Polynomial Time Algorithm for the Cutwidth of Bounded Degree Graphs with Small Treewidth
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
FORCE: a fast and easy-to-implement variable-ordering heuristic
Proceedings of the 13th ACM Great Lakes symposium on VLSI
Using Cutwidth to Improve Symbolic Simulation and Boolean Satisfiability
HLDVT '01 Proceedings of the Sixth IEEE International High-Level Design Validation and Test Workshop (HLDVT'01)
Journal of Artificial Intelligence Research
The good old Davis-Putnam procedure helps counting models
Journal of Artificial Intelligence Research
On the role of modeling causal independence for system model compilation with OBDDs
AI Communications - Model-Based Systems
Using OBDDs for Efficient Query Evaluation on Probabilistic Databases
SUM '08 Proceedings of the 2nd international conference on Scalable Uncertainty Management
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
DPLL with a trace: from SAT to knowledge compilation
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
Top-Down Algorithms for Constructing Structured DNNF: Theoretical and Practical Implications
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
On Decomposability and Interaction Functions
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Treewidth in verification: local vs. global
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
A new approach to model counting
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
On the tractability of query compilation and bounded treewidth
Proceedings of the 15th International Conference on Database Theory
Probabilistic databases with MarkoViews
Proceedings of the VLDB Endowment
Compiling probabilistic graphical models using sentential decision diagrams
ECSQARU'13 Proceedings of the 12th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
| Hi-index | 0.00 |
The DPLL procedure has found great success in SAT, where search terminates on the first solution discovered. We show that this procedure is equally promising in a problem where exhaustive search is used, given that it is augmented with appropriate caching. Specifically, we propose two DPLL-based algorithms that construct OBDDs for CNF formulas. These algorithms have a worst-case complexity that is linear in the number of variables and size of the CNF, and exponential only in the cutwidth or pathwidth of the variable ordering. We show how modern SAT techniques can be harnessed by implementing the algorithms on top of an existing SAT solver. We discuss the advantage of this new construction method over the traditional approach, where OBDDs for subsets of the CNF formula are built and conjoined. Our experiments indicate that on many CNF benchmarks, the new method runs orders of magnitude faster than a comparable implementation of the traditional method.