Bridging Constraint Satisfaction and Boolean Satisfiability

Nonfiction, Computers, Advanced Computing, Artificial Intelligence, Computer Science, General Computing
Cover of the book Bridging Constraint Satisfaction and Boolean Satisfiability by Justyna Petke, Springer International Publishing
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Justyna Petke ISBN: 9783319218106
Publisher: Springer International Publishing Publication: August 25, 2015
Imprint: Springer Language: English
Author: Justyna Petke
ISBN: 9783319218106
Publisher: Springer International Publishing
Publication: August 25, 2015
Imprint: Springer
Language: English

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. 

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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. 

More books from Springer International Publishing

Cover of the book Flexibility of Group Actions on the Circle by Justyna Petke
Cover of the book Advances in Production Management Systems. Initiatives for a Sustainable World by Justyna Petke
Cover of the book Modeling Nonlinear Problems in the Mechanics of Strings and Rods by Justyna Petke
Cover of the book Management in the Digital Age by Justyna Petke
Cover of the book A New Paradigm for Greek Agriculture by Justyna Petke
Cover of the book R for Marketing Research and Analytics by Justyna Petke
Cover of the book Intelligence and Security Oversight by Justyna Petke
Cover of the book Granular-Relational Data Mining by Justyna Petke
Cover of the book On the Ecology of Australia’s Arid Zone by Justyna Petke
Cover of the book Pattern Recognition by Justyna Petke
Cover of the book Guanidines as Reagents and Catalysts II by Justyna Petke
Cover of the book Women Researching in Africa by Justyna Petke
Cover of the book A Systems Biology Approach to Advancing Adverse Outcome Pathways for Risk Assessment by Justyna Petke
Cover of the book Verified Software: Theories, Tools, and Experiments by Justyna Petke
Cover of the book Managing Improvement in Healthcare by Justyna Petke
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy