Concurrent cube-and-conquer

  • Authors:

  • Peter van der Tak;Marijn J. H. Heule;Armin Biere

  • Affiliations:

  • Delft University of Technology, The Netherlands;Delft University of Technology, The Netherlands, University of Texas, Austin, United States;Johannes Kepler University, Linz, Austria

  • Venue:
  • SAT'12 Proceedings of the 15th international conference on Theory and Applications of Satisfiability Testing
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Satisfiability solvers targeting industrial instances are currently almost always based on conflict-driven clause learning (CDCL) [5]. This technique can successfully solve very large instances. Yet on small, hard problems lookahead solvers [3] often perform better by applying much more reasoning in each search node and then recursively splitting the search space until a solution is found.