Bridging constraint satisfaction and Boolean satisfiability [electronic resource] / Justyna Petke.

Unlimited

Authorized users

Can lend chapters, not whole ebooks

Bridging constraint satisfaction and Boolean satisfiability [electronic resource] / Justyna Petke.

9783319218106 electronic book
3319218107 electronic book
9783319218090
3319218093

Switzerland : Springer, [2015]

©2015

English

1 online resource : illustrations

10.1007/978-3-319-21810-6 doi

QA267.7

511.3

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

Includes bibliographical references.

Access limited to authorized users.

Online resource; title from PDF title page (viewed August 27, 2015).

Artificial intelligence (Berlin, Germany)

Print version: 9783319218090

Online Resources > Ebooks
All Resources