Computer Software
Print ISSN : 0289-6540
Interplay between SAT and Other Constraint Problems
Masahiro SAKAITakeo IMAI
Author information
JOURNALS FREE ACCESS

2015 Volume 32 Issue 1 Pages 1_103-1_119

Details
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.

Information related to the author
© 2015 Japan Society for Software Science and Technology
Previous article Next article
feedback
Top