Interplay between SAT and Other Constraint Problems

Abstract

Boolean SATisfiability problem (hereafter SAT) is the problem of deciding whether there exists an assignment to variables in a given propositional formula that makes the formula true. SAT is a computationally difficult problem as it is a classical NP-complete problem, but development of practically fast algorithms and hardware speed-ups enable SAT solvers to be used in variety of real applications.
In this paper, we survey applications of SAT algorithms into broader problem classes, and technical interplays between SAT research and other research fields around those problem classes.