SAT Solving with Reference Points

  • Stephan Kottler
Conference paper

DOI: 10.1007/978-3-642-14186-7_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6175)
Cite this paper as:
Kottler S. (2010) SAT Solving with Reference Points. In: Strichman O., Szeider S. (eds) Theory and Applications of Satisfiability Testing – SAT 2010. SAT 2010. Lecture Notes in Computer Science, vol 6175. Springer, Berlin, Heidelberg


Many state-of-the-art SAT solvers use the VSIDS heuristic to make branching decisions based on the activity of variables or literals. In combination with rapid restarts and phase saving this yields a powerful decision heuristic in practice. However, there are approaches that motivate more in-depth reasoning to guide the search of the SAT solver. But more reasoning often requires more information and comes along with more complex data structures. This may sometimes even cause strong concepts to be inapplicable in practice.

In this paper we present a suitable data structure for the DMRP approach to overcome the problem above. Moreover, we show how DMRP can be combined with CDCL solving to be competitive to state-of-the-art solvers and to even improve on some families of industrial instances.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Stephan Kottler
    • 1
  1. 1.Wilhelm–Schickard–InstituteUniversity of TübingenGermany

Personalised recommendations