Concurrent Cube-and-Conquer

(Poster Presentation)
  • Peter van der Tak
  • Marijn J. H. Heule
  • Armin Biere
Conference paper

DOI: 10.1007/978-3-642-31612-8_42

Part of the Lecture Notes in Computer Science book series (LNCS, volume 7317)
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

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.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Peter van der Tak
    • 1
  • Marijn J. H. Heule
    • 1
    • 2
  • Armin Biere
    • 3
  1. 1.Delft University of TechnologyThe Netherlands
  2. 2.University of TexasAustinUnited States
  3. 3.Johannes Kepler UniversityLinzAustria

Personalised recommendations