SAT-Solving in Practice
Paper i proceeding, 2008

Satisfiability solving, the problem of deciding whether the variables of a propositional formula can be assigned in such a way that the formula evaluates to true, is one of the classic problems in computer science. It is of theoretical interest because it is the canonical NP-complete problem. It is of practical interest because modern SAT-solvers can be used to solve many important and practical problems. In this tutorial paper, we show briefly how such SAT-solvers are implemented, and point to some typical applications of them. Our aim is to provide sufficient information (much of it through the reference list) to kick-start researchers from new fields wishing to apply SAT-solvers to their problems.


Koen Lindström Claessen

Chalmers, Data- och informationsteknik, Programvaruteknik (Chalmers)

Niklas Een


Mary Sheeran

Chalmers, Data- och informationsteknik, Programvaruteknik (Chalmers)

Niklas Sörensson

Göteborgs universitet

9th International Workshop on Discrete Event Systems, WODES' 08; Goteborg; Sweden; 28 May 2008 through 30 May 2008

61-67 4605923
978-142442592-1 (ISBN)


Data- och informationsvetenskap





Mer information

Senast uppdaterat