A decision procedure for bit-vector arithmetic
DAC '98 Proceedings of the 35th annual Design Automation Conference
GRASP: A Search Algorithm for Propositional Satisfiability
IEEE Transactions on Computers
A Linear Format for Resolution With Merging and a New Technique for Establishing Completeness
Journal of the ACM (JACM)
Fast Decision Procedures Based on Congruence Closure
Journal of the ACM (JACM)
Deciding Combinations of Theories
Journal of the ACM (JACM)
Simplification by Cooperating Decision Procedures
ACM Transactions on Programming Languages and Systems (TOPLAS)
ACM Transactions on Computational Logic (TOCL)
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Propositional Logic: Deduction and Algorithms
Propositional Logic: Deduction and Algorithms
Computer Algorithms: Introduction to Design and Analysis
Computer Algorithms: Introduction to Design and Analysis
Efficient conflict driven learning in a boolean satisfiability solver
Proceedings of the 2001 IEEE/ACM international conference on Computer-aided design
Validity Checking for Combinations of Theories with Equality
FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
CAV '01 Proceedings of the 13th International Conference on Computer Aided Verification
A Framework for Cooperating Decision Procedures
CADE-17 Proceedings of the 17th International Conference on Automated Deduction
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Successive Approximation of Abstract Transition Relations
LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
BerkMin: A Fast and Robust Sat-Solver
Proceedings of the conference on Design, automation and test in Europe
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Verification of Proofs of Unsatisfiability for CNF Formulas
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Toward Leaner Binary-Clause Reasoning in a Satisfiability Solver
Annals of Mathematics and Artificial Intelligence
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Trust and Automation in Verification Tools
ATVA '08 Proceedings of the 6th International Symposium on Automated Technology for Verification and Analysis
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
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Towards understanding and harnessing the potential of clause learning
Journal of Artificial Intelligence Research
An observation on time-storage trade off
Journal of Computer and System Sciences
Verifying propositional unsatisfiability: pitfalls to avoid
SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
A generalized framework for conflict analysis
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Extended resolution proofs for conjoining BDDs
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Pool resolution and its relation to regular resolution and DPLL with clause learning
LPAR'05 Proceedings of the 12th international conference on Logic for Programming, Artificial Intelligence, and Reasoning
An improved separation of regular resolution from pool resolution and clause learning
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Contributions to the theory of practical quantified boolean formula solving
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
Efficient clause learning for quantified boolean formulas via QBF pseudo unit propagation
SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
| Hi-index | 0.00 |
The importance of producing a certificate of unsatisfiability is increasingly recognized for high performance propositional satisfiability solvers. The leading solvers develop a conflict graph as the basis for deriving (or "learning") new clauses. Extracting a resolution derivation from the conflict graph is theoretically straightforward, but resolution proofs can be extremely long. This paper reports on a tool that has verified proofs more than 1600 gigabytes long. Several other certificate formats have been proposed and studied, but the verifiers for these formats are beyond any hope of automated verification in their own rights. However, some of the alternative formats enjoy the advantages of being easy to produce proofs for, and reasonable in their space requirements. This paper reports progress on developing a practical system for formal verification of a more compact certificate format. Experimental comparisons are presented. A format called RUP (for Reverse Unit Propagation) is introduced and two implementations are evaluated. This method is an extension of conflict-clause proofs introduced by Goldberg and Novikov, and is compatible with conflict-clause minimization. Extracting a resolution derivation from other decidable theories is discussed briefly.