Building a Hybrid SAT Solver via Conflict-Driven, Look-Ahead and XOR Reasoning Techniques

Authors:
Jingchao Chen
Affiliations:
School of Informatics, Donghua University, Shanghai, P.R. China 201620
Venue:
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
Year:
2009

Citing 10
Cited 4

Effective use of boolean satisfiability procedures in the formal verification of superscalar and VLIW

Proceedings of the 38th annual Design Automation Conference
Chaff: engineering an efficient SAT solver

Proceedings of the 38th annual Design Automation Conference
SATO: An Efficient Propositional Prover

CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Integrating Equivalency Reasoning into Davis-Putnam Procedure

Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
The complexity of theorem-proving procedures

STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
The SAT2002 Competition

Annals of Mathematics and Artificial Intelligence
Effective incorporation of double look-ahead procedures

SAT'07 Proceedings of the 10th international conference on Theory and applications of satisfiability testing
Local restarts

SAT'08 Proceedings of the 11th international conference on Theory and applications of satisfiability testing
Aligning CNF- and equivalence-reasoning

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing
Fifty-five solvers in vancouver: the SAT 2004 competition

SAT'04 Proceedings of the 7th international conference on Theory and Applications of Satisfiability Testing

Extending Clause Learning DPLL with Parity Reasoning

Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Conflict-driven XOR-clause learning

SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
When boolean satisfiability meets gaussian elimination in a simplex way

CAV'12 Proceedings of the 24th international conference on Computer Aided Verification
Classifying and propagating parity constraints

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper develops a new hybrid SAT solver, called MoRsat. The framework of the solver is based on a look-ahead technique, and its core is a conflict-driven search. A look-ahead technique is used to split the original problem to sub-problems, each of them is either solved or aborted by a conflict-driven DPLL. Aborted sub-problems are solved recursively. We present new properties of XOR clauses, which are used to incorporate XOR reasoning into our conflict-driven DPLL. Compared with the latest versions of Rsat and March, the Gold Medal winners in the industrial and handmade SAT category of the SAT 2007 competition, MoRsat achieves remarkable improvements. Moreover, MoRsat can solve some industrial instances that were not solved in the SAT 2007 competition.