Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
A Computing Procedure for Quantification Theory
Journal of the ACM (JACM)
A Machine-Oriented Logic Based on the Resolution Principle
Journal of the ACM (JACM)
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 without BDDs
TACAS '99 Proceedings of the 5th International Conference on Tools and Algorithms for Construction and Analysis of Systems
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
FORCE: a fast and easy-to-implement variable-ordering heuristic
Proceedings of the 13th ACM Great Lakes symposium on VLSI
Journal of Symbolic Computation
Checking satisfiability of a conjunction of BDDs
Proceedings of the 40th annual Design Automation Conference
BerkMin: A Fast and Robust Sat-Solver
Proceedings of the conference on Design, automation and test in Europe
Resolution and binary decision diagrams cannot simulate each other polynomially
Discrete Applied Mathematics - The renesse issue on satisfiability
A satisfiability procedure for quantified boolean formulae
Discrete Applied Mathematics - The renesse issue on satisfiability
Formal methods for the validation of automotive product configuration data
Artificial Intelligence for Engineering Design, Analysis and Manufacturing
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Toward Good Elimination Orders for Symbolic SAT Solving
ICTAI '04 Proceedings of the 16th IEEE International Conference on Tools with Artificial Intelligence
Scalable error detection using boolean satisfiability
Proceedings of the 32nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Towards understanding and harnessing the potential of clause learning
Journal of Artificial Intelligence Research
Automatic abstraction without counterexamples
TACAS'03 Proceedings of the 9th international conference on Tools and algorithms for the construction and analysis of systems
CirCUs: a hybrid satisfiability solver
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Search vs. symbolic techniques in satisfiability solving
SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Solving difficult instances of Boolean satisfiability in the presence of symmetry
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
On resolution proofs for combinational equivalence
Proceedings of the 44th annual Design Automation Conference
Improved Conflict-Clause Minimization Leads to Improved Propositional Proof Traces
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Dynamic Symmetry Breaking by Simulating Zykov Contraction
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Evaluating and certifying QBFs: A comparison of state-of-the-art tools
AI Communications
A first step towards a unified proof checker for QBF
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Artificial Intelligence
Variable and clause ordering in an FSA approach to propositional satisfiability
CIAA'11 Proceedings of the 16th international conference on Implementation and application of automata
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
A more efficient BDD-based QBF solver
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Extended resolution proofs for symbolic SAT solving with quantification
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
A finite state intersection approach to propositional satisfiability
Theoretical Computer Science
Solving difficult SAT problems by using OBDDs and greedy clique decomposition
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
Producing and verifying extremely large propositional refutations
Annals of Mathematics and Artificial Intelligence
Verifying refutations with extended resolution
CADE'13 Proceedings of the 24th international conference on Automated Deduction
| Hi-index | 0.00 |
We present a method to convert the construction of binary decision diagrams (BDDs) into extended resolution proofs. Besides in proof checking, proofs are fundamental to many applications and our results allow the use of BDDs instead—or in combination with—established proof generation techniques, based for instance on clause learning. We have implemented a proof generator for propositional logic formulae in conjunctive normal form, called EBDDRES. We present details of our implementation and also report on experimental results. To our knowledge this is the first step towards a practical application of extended resolution.