Abstract. We compare two prominent decision procedures for propositional logic: Ordered Binary Decision Diagrams (obdds) and the DavisPutnam procedure. Experimental results indicate that the Davis-Putnam procedure outperforms obdds in hard constraint-satisfaction problems, while obdds are clearly superior for Boolean functional equivalence problems from the circuit domain, and, in general, problems that require the schematization of a large number of solutions that share a common structure. The two methods illustrate the different and often complementary strengths of constraint-oriented and search-oriented procedures. 1
|
2483
|
Graph-based algorithms for Boolean function manipulation
– Bryant
- 1986
|
|
1210
|
Symbolic Model Checking
– McMillan
- 1993
|
|
822
|
A computing procedure for quantification theory
– Davis, Putnam
- 1960
|
|
765
|
Symbolic Boolean manipulation with ordered binary-decision diagrams
– Bryant
- 1992
|
|
582
|
A New Method for Solving Hard Satisfiability Problems
– Selman, Levesque, et al.
- 1992
|
|
454
|
Efficient implementation of a BDD Package
– Brace, Rudell, et al.
- 1990
|
|
393
|
Dynamic variable ordering for ordered binary decision diagrams
– Rudell
- 1993
|
|
375
|
Symbolic model checking: 10 states and beyond
– Burch, Clarke, et al.
- 1992
|
|
326
|
A machine program for theorem-proving
– Davis, Logemann, et al.
- 1962
|
|
240
|
On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication
– Bryant
- 1991
|
|
208
|
Algebraic Decision Diagrams and Their Applications
– Bahar, Frohm, et al.
- 1993
|
|
200
|
Experimental results on the crossover point in satisfiability problems
– Crawford, Auton
- 1993
|
|
137
|
Multi-terminal binary decision diagrams: An efficient data structure for matrix representation
– Clarke, Fujita, et al.
- 1993
|
|
104
|
Zero-suppressed BDDs for set manipulation in combinatorial problems
– Minato
- 1993
|
|
87
|
Model Checking, Abstraction, and Compositional Verification
– Long
- 1993
|
|
86
|
Finding the optimal variable ordering for binary decision diagrams
– Friedman, Supowit
- 1990
|
|
55
|
Automatic generation of some results in finite algebra
– Fujita, Slaney, et al.
- 1993
|
|
55
|
Refutational Theorem Proving using Term Rewriting Systems
– Hsiang
- 1985
|
|
52
|
Automated reasoning and exhaustive search: Quasigroup existence problems
– Slaney, Fujita, et al.
- 1995
|
|
37
|
Reducing bdd size by exploiting functional dependencies
– HU, DILL
- 1993
|
|
37
|
Linking Bdd-based symbolic evaluation to interactive theorem proving
– Joyce, Seger
- 1993
|
|
37
|
Embedding Boolean expressions into logic programming
– Buttner, Simonis
- 1987
|
|
35
|
Heuristics to compute variable orderings for efficient manipulation of ordered binary decision diagrams
– Butler, Ross, et al.
- 1991
|
|
35
|
Implementing the Davis-Putnam algorithm by tries
– Zhang, Stickel
- 1994
|
|
19
|
A new algorithm for the binate covering problem and its application to the minimization of Boolean relations
– Jeong, Somenzi
- 1992
|
|
19
|
A decision procedure for propositional logic. Association for Automated Reasoning
– Zhang
- 1993
|
|
17
|
A tough nut for proof procedures
– McCarthy
- 1964
|
|
16
|
Multi-valued decision diagrams
– Kam, Brayton
- 1990
|
|
15
|
Comparing two-level and ordered binary decision diagram representations of logic functions
– Devadas
- 1993
|
|
10
|
Introduction to the OBDD algorithm for the ATP community
– Moore
- 1994
|
|
8
|
Embedding Boolean Expressions into Logic Programming
– uttner, W, et al.
- 1987
|
|
7
|
Differential BDDs
– Anuchitanakul, Manna, et al.
- 1995
|
|
7
|
Application of term rewriting techniques to hardware design verification
– Chandrasekhar, Privitera, et al.
- 1987
|
|
7
|
Finder version 3.0 notes and guide
– Slaney
- 1993
|
|
6
|
The Use of Renaming to Improve the Efficiency of Clausal Theorem Proving
– Tour, Chaminade
- 1990
|
|
6
|
Propositional calculus problems in CHIP
– Simonis, Dincbas
- 1990
|
|
5
|
Notes on the Design of an Open Boolean Solver
– Rauzy
- 1994
|
|
5
|
A Mechanized Framework for Specifying Problem Domains and Verifying Plans
– Subramanian
- 1993
|
|
4
|
Using enumerative methods for Boolean unification
– Rauzy
- 1993
|
|
3
|
Formal VLSI Correctness Verification---VLSI Design Methods, vol
– Claesen, Ed
- 1990
|
|
3
|
Towards first-order deduction based on Shannon graphs
– Possega, ascher, et al.
- 1992
|
|
2
|
Personal communication. ECRC
– Wallace
- 1993
|
|
1
|
Chih-Yuan Yang, and Xudong Zhao. Multi-terminal binary decision diagrams: an efficient data structure for matrix representation
– Clarke, Fujita, et al.
- 1993
|
|
1
|
Mehmet Dincbas. Propositional calculus problems in CHIP
– Simonis
- 1993
|
|
