SAT-solving in practice

Koen Claessen, Niklas Een, Mary Sheeran, Niklas Sorensson
2008 2008 9th International Workshop on Discrete Event Systems  
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
more » ... 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.
doi:10.1109/wodes.2008.4605923 fatcat:c3w2p5n2ena33aozdweue4eklq