โ Scribed by Justyna Petke (auth.)
No coin nor oath required. For personal study only.
This book provides a significant step towards bridging the areas of Boolean satisfiability and constraint satisfaction by answering the question why SAT-solvers are efficient on certain classes of CSP instances which are hard to solve for standard constraint solvers. The author also gives theoretical reasons for choosing a particular SAT encoding for several important classes of CSP instances.
Boolean satisfiability and constraint satisfaction emerged independently as new fields of computer science, and different solving techniques have become standard for problem solving in the two areas. Even though any propositional formula (SAT) can be viewed as an instance of the general constraint satisfaction problem (CSP), the implications of this connection have only been studied in the last few years.
The book will be useful for researchers and graduate students in artificial intelligence and theoretical computer science.
Front Matter....Pages i-xi
Introduction....Pages 1-3
Background....Pages 5-23
Solver performance on tractable CSPs: empirical evaluation....Pages 25-41
SAT encodings....Pages 43-54
From CSP to SAT: width restrictions....Pages 55-74
From CSP to SAT: language restrictions....Pages 75-88
SAT encodings of a classical problem: a case study....Pages 89-98
Conclusions....Pages 99-103
Back Matter....Pages 105-113
Artificial Intelligence (incl. Robotics); Theory of Computation
๐ SIMILAR VOLUMES
Many fundamental combinatorial problems, arising in such diverse fields as artificial intelligence, logic, graph theory, and linear algebra, can be formulated as Boolean constraint satisfaction problems (CSP). This book is devoted to the study of the complexity of such problems. The authors' goa