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 Intelligence Systems in Environmental Management: Theory and Applications by Justyna Petke
Cover of the book Atlas of Trace Fossils in Well Core by Justyna Petke
Cover of the book The NIPS '17 Competition: Building Intelligent Systems by Justyna Petke
Cover of the book Martin Davis on Computability, Computational Logic, and Mathematical Foundations by Justyna Petke
Cover of the book Composite Synthetic Scaffolds for Tissue Engineering and Regenerative Medicine by Justyna Petke
Cover of the book Competence Based Education and Training (CBET) and the End of Human Learning by Justyna Petke
Cover of the book Focus on Bio-Image Informatics by Justyna Petke
Cover of the book Women, Economic Development, and Higher Education by Justyna Petke
Cover of the book Flood Risk in the Upper Vistula Basin by Justyna Petke
Cover of the book A Life Devoted to Quality of Life by Justyna Petke
Cover of the book Philosophy, Law and the Family by Justyna Petke
Cover of the book Dependability Engineering and Complex Systems by Justyna Petke
Cover of the book Commemoration and Oblivion in Royalist Print Culture, 1658-1667 by Justyna Petke
Cover of the book Lean Manufacturing in the Developing World by Justyna Petke
Cover of the book Scalar Wave Driven Energy Applications 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