Journal of the ACM (JACM)
Symbolic model checking using SAT procedures instead of BDDs
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
On a generalization of extended resolution
Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
Using SAT for combinational equivalence checking
Proceedings of the conference on Design, automation and test in Europe
Computer-Aided Reasoning: An Approach
Computer-Aided Reasoning: An Approach
Checking Safety Properties Using Induction and a SAT-Solver
FMCAD '00 Proceedings of the Third International Conference on Formal Methods in Computer-Aided Design
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
Improvements to combinational equivalence checking
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
Industrial Strength SAT-based Alignability Algorithm for Hardware Equivalence Verification
FMCAD '07 Proceedings of the Formal Methods in Computer Aided Design
Efficiently Calculating Evolutionary Tree Measures Using SAT
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
Predicting learnt clauses quality in modern SAT solvers
IJCAI'09 Proceedings of the 21st international jont conference on Artifical intelligence
Industrial-strength certified SAT solving through verified SAT proof checking
ICTAC'10 Proceedings of the 7th International colloquium conference on Theoretical aspects of computing
Automated design debugging with maximum satisfiability
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Extended resolution proofs for conjoining BDDs
CSR'06 Proceedings of the First international computer science conference on Theory and Applications
Effective preprocessing in SAT through variable and clause elimination
SAT'05 Proceedings of the 8th international conference on Theory and Applications of Satisfiability Testing
Automated testing and debugging of SAT and QBF solvers
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Extended resolution proofs for symbolic SAT solving with quantification
SAT'06 Proceedings of the 9th international conference on Theory and Applications of Satisfiability Testing
Coprocessor 2.0: a flexible CNF simplifier
SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
| Hi-index | 0.00 |
Modern SAT solvers use preprocessing and inprocessing techniques that are not solely based on resolution; existing unsatisfiability proof formats do not support SAT solvers using such techniques. We present a new proof format for checking unsatisfiability proofs produced by SAT solvers that use techniques such as extended resolution and blocked clause addition. Our new format was designed with three goals: proofs should be easy to generate, proofs should be compact, and validating proofs must be simple. We show how existing preprocessors and solvers can be modified to generate proofs in our new format. Additionally, we implemented a mechanically-verified proof checker in ACL2 and a proof checker in C for the proposed format.