Theory and Applications of Satisfiability Testing – SAT 2012

Volume 7317 of the series Lecture Notes in Computer Science pp 475-476

Concurrent Cube-and-Conquer

(Poster Presentation)
  • Peter van der TakAffiliated withDelft University of Technology
  • , Marijn J. H. HeuleAffiliated withDelft University of TechnologyUniversity of Texas
  • , Armin BiereAffiliated withJohannes Kepler University


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.