A machine program for theorem-proving
Communications of the ACM
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 solving with reference points
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
An overview of parallel SAT solving
Constraints
| Hi-index | 0.00 |
“Determinization” of resolution is usually done by a DPLL-like procedure that operates on partial assignments. We introduce a resolution-based SAT-solver operating on complete assignments and give a theoretical justification for determinizing resolution this way. This justification is based on the notion of a point image of resolution proof. We give experimental results confirming the viability of our approach. The complete version of this paper is given in [2].