Cube and conquer: guiding CDCL SAT solvers by lookaheads

Authors:
Marijn J. H. Heule;Oliver Kullmann;Siert Wieringa;Armin Biere
Affiliations:
Delft University of Technology, The Netherlands,Johannes Kepler University Linz, Austria;Swansea University, United Kingdom;Aalto University Helsinki, Finland;Johannes Kepler University Linz, Austria
Venue:
HVC'11 Proceedings of the 7th international Haifa Verification conference on Hardware and Software: verification and testing
Year:
2011

Citing 8
Cited 6

A machine program for theorem-proving

Communications of the ACM
Enhancing Davis Putnam with extended binary clause reasoning

Eighteenth national conference on Artificial intelligence
Heuristics based on unit propagation for satisfiability problems

IJCAI'97 Proceedings of the 15th international joint conference on Artifical intelligence - Volume 1
Limited discrepancy search

IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 1
A backbone-search heuristic for efficient solving of hard 3-SAT formulae

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Partitioning SAT instances for distributed solving

LPAR'10 Proceedings of the 17th international conference on Logic for programming, artificial intelligence, and reasoning
Grid-based SAT solving with iterative partitioning and clause learning

CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
Green-Tao numbers and SAT

SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing

Designing scalable parallel SAT solvers

SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
An efficient method for solving UNSAT 3-SAT and similar instances via static decomposition

SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
Asynchronous multi-core incremental SAT solving

TACAS'13 Proceedings of the 19th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Soundness of inprocessing in clause sharing SAT solvers

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Concurrent clause strengthening

SAT'13 Proceedings of the 16th international conference on Theory and Applications of Satisfiability Testing
Generalising Unit-Refutation Completeness and SLUR via Nested Input Resolution

Journal of Automated Reasoning

Quantified Score

Hi-index	0.00

Visualization

Abstract

Satisfiability (SAT) is considered as one of the most important core technologies in formal verification and related areas. Even though there is steady progress in improving practical SAT solving, there are limits on scalability of SAT solvers. We address this issue and present a new approach, called cube-and-conquer, targeted at reducing solving time on hard instances. This two-phase approach partitions a problem into many thousands (or millions) of cubes using lookahead techniques. Afterwards, a conflict-driven solver tackles the problem, using the cubes to guide the search. On several hard competition benchmarks, our hybrid approach outperforms both lookahead and conflict-driven solvers. Moreover, because cube-and-conquer is natural to parallelize, it is a competitive alternative for solving SAT problems in parallel.