Symbolic Boolean manipulation with ordered binary-decision diagrams
ACM Computing Surveys (CSUR)
An optimality result for clause form translation
Journal of Symbolic Computation
GRASP: A Search Algorithm for Propositional Satisfiability
IEEE Transactions on Computers
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
On a generalization of extended resolution
Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
A machine program for theorem-proving
Communications of the ACM
Algorithms and Data Structures in VLSI Design
Algorithms and Data Structures in VLSI Design
A Tutorial on Stålmarcks's Proof Procedure for Propositional Logic
FMCAD '98 Proceedings of the Second International Conference on Formal Methods in Computer-Aided Design
A Compressed Breadth-First Search for Satisfiability
ALENEX '02 Revised Papers from the 4th International Workshop on Algorithm Engineering and Experiments
Ordered Binary Decision Diagrams and the Davis-Putnam Procedure
CCL '94 Proceedings of the First International Conference on Constraints in Computational Logics
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Multi-resolution on compressed sets of clauses
ICTAI '00 Proceedings of the 12th IEEE International Conference on Tools with Artificial Intelligence
Resolution and binary decision diagrams cannot simulate each other polynomially
Discrete Applied Mathematics - The renesse issue on satisfiability
On the relative efficiency of DPLL and OBDDs with axiom and join
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
| Hi-index | 0.04 |
We prove that binary decision diagrams [R. Bryant, Symbolic Boolean manipulation with ordered binary decision diagrams, ACM Comput. Surveys 23 (3) (1992)] can be polynomially simulated by the extended resolution rule of [G.S. Tseitin, On the complexity of derivation in propositional calculus, in: A. Slisenko (Ed.), Studies in Constructive Mathematics and Mathematical Logics, 1968]. More precisely, for any unsatisfiable formula @f, there exists an extended resolution refutation of @f where the number of steps is polynomially bounded by the maximal size of the BDDs built from the formulae occurring in @f.