product description page
Bridging Constraint Satisfaction and Boolean Satisfiability (Hardcover) (Justyna Petke)
about this item
This book represents a significant step towards bridging the areas of Boolean satisfiability and constraint satisfaction by providing theoretical explanations for why SAT-solvers are efficient on certain classes of CSPs and under which SAT encodings tractability of the original CSP instance is preserved.
These fields emerged independently, and they developed different standard problem-solving solutions. In the meantime it is understood that any propositional formula can actually be viewed as an instance of the general constraint satisfaction problem, but the implications of this connection have only been studied in the last few years.
This book will be useful for researchers and graduate students in artificial intelligence and theoretical computer science.