Beyond Unit Propagation in SAT Solving

  • Michael Kaufmann
  • Stephan Kottler
Conference paper

DOI: 10.1007/978-3-642-20662-7_23

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6630)
Cite this paper as:
Kaufmann M., Kottler S. (2011) Beyond Unit Propagation in SAT Solving. In: Pardalos P.M., Rebennack S. (eds) Experimental Algorithms. SEA 2011. Lecture Notes in Computer Science, vol 6630. Springer, Berlin, Heidelberg

Abstract

The tremendous improvement in SAT solving has made SAT solvers a core engine for many real world applications. Though still being a branch-and-bound approach purposive engineering of the original algorithm has enhanced state-of-the-art solvers to tackle huge and difficult SAT instances. The bulk of solving time is spent on iteratively propagating variable assignments that are implied by decisions.

In this paper we present two approaches on how to extend the broadly applied Unit Propagation technique where a variable assignment is implied iff a clause has all but one of its literals assigned to false. We propose efficient ways to utilize more reasoning in the main component of current SAT solvers so as to be less dependent on felicitous branching decisions.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Michael Kaufmann
    • 1
  • Stephan Kottler
    • 1
  1. 1.Wilhelm–Schickard–Institut für InformatikUniversity of TübingenGermany

Personalised recommendations