- Cite this paper as:
- van der Tak P., Heule M.J.H., Biere A. (2012) Concurrent Cube-and-Conquer. In: Cimatti A., Sebastiani R. (eds) Theory and Applications of Satisfiability Testing – SAT 2012. SAT 2012. Lecture Notes in Computer Science, vol 7317. Springer, Berlin, Heidelberg
Satisfiability solvers targeting industrial instances are currently almost always based on conflict-driven clause learning (CDCL) . This technique can successfully solve very large instances. Yet on small, hard problems lookahead solvers  often perform better by applying much more reasoning in each search node and then recursively splitting the search space until a solution is found.