Bridging Constraint Satisfaction and Boolean Satisfiability (Hardcover, 1st ed. 2015)

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.

General

Imprint:	Springer International Publishing AG
Country of origin:	Switzerland
Series:	Artificial Intelligence: Foundations, Theory, and Algorithms
Release date:	August 2015
First published:	2015
Authors:	Justyna Petke
Dimensions:	235 x 155 x 10mm (L x W x T)
Format:	Hardcover - Cloth over boards
Pages:	113
Edition:	1st ed. 2015
ISBN-13:	978-3-319-21809-0
Categories:	Books > Computing & IT > General theory of computing > Mathematical theory of computation Promotions
LSN:	3-319-21809-3
Barcode:	9783319218090

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!