SAT-Solving in Practice
Paper in proceedings, 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.

Author

Koen Lindström Claessen

Chalmers, Computer Science and Engineering (Chalmers), Software Engineering and Technology (Chalmers)

Niklas Een

Chalmers

Mary Sheeran

Chalmers, Computer Science and Engineering (Chalmers), Software Engineering and Technology (Chalmers)

Niklas Sörensson

University of Gothenburg

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

61-67 4605923

Subject Categories

Computer and Information Science

DOI

10.1109/WODES.2008.4605923

ISBN

978-142442592-1

More information

Latest update

9/10/2018