GRASP: A Search Algorithm for Propositional Satisfiability
IEEE Transactions on Computers
Symbolic model checking using SAT procedures instead of BDDs
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
On Interpolation and Automatization for Frege Systems
SIAM Journal on Computing
A machine program for theorem-proving
Communications of the ACM
Chaff: engineering an efficient SAT solver
Proceedings of the 38th annual Design Automation Conference
Proving Unsatisfiability of CNFs Locally
Journal of Automated Reasoning
SATO: An Efficient Propositional Prover
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
BerkMin: A Fast and Robust Sat-Solver
Proceedings of the conference on Design, automation and test in Europe
Using Problem Symmetry in Search Based Satisfiability Algorithms
Proceedings of the conference on Design, automation and test in Europe
Efficient SAT solving: beyond supercubes
Proceedings of the 42nd annual Design Automation Conference
Resolution Is Not Automatizable Unless W[P] Is Tractable
SIAM Journal on Computing
On bridging simulation and formal verification
VMCAI'08 Proceedings of the 9th international conference on Verification, model checking, and abstract interpretation
A decision-making procedure for resolution-based SAT-solvers
SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
SAT-based counterexample-guided abstraction refinement
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Generating high-quality tests for Boolean circuits by treating tests as proof encoding
TAP'10 Proceedings of the 4th international conference on Tests and proofs
Boosting local search thanks to CDCL
LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Sat-solving based on boundary point elimination
HVC'10 Proceedings of the 6th international conference on Hardware and software: verification and testing
A CSP solver focusing on FAC variables
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
| Hi-index | 0.00 |
We use the notion of boundary points to study resolution proofs. Given a CNF formula F , a lit (x )-boundary point is a complete assignment falsifying only clauses of F having the same literal lit (x ) of variablex . A lit (x )-boundary point mandates a resolution on variable x . Adding the resolvent of this resolution to F eliminates this boundary point. Any resolution proof has to eventually eliminate all boundary points of F . Hence one can study resolution proofs from the viewpoint of boundary point elimination. We use equivalence checking formulas to compare proofs of their unsatisfiability built by a conflict driven SAT-solver and very short proofs tailored to these formulas. We show experimentally that in contrast to proofs generated by this SAT-solver, almost every resolution of a specialized proof eliminates a boundary point. This implies that one may use the share of resolutions eliminating boundary points as a metric for proof quality.