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 Formal Ontologies Meet Industry by Justyna Petke
Cover of the book From Riemann to Differential Geometry and Relativity by Justyna Petke
Cover of the book Nano-photonics in III-V Semiconductors for Integrated Quantum Optical Circuits by Justyna Petke
Cover of the book Foundations of Hardware IP Protection by Justyna Petke
Cover of the book Cloud Computing and Security by Justyna Petke
Cover of the book Biology of Hevea Rubber by Justyna Petke
Cover of the book Solar Cosmic Rays by Justyna Petke
Cover of the book The Tidal Disruption of Stars by Supermassive Black Holes by Justyna Petke
Cover of the book Wellbeing and Aspirational Culture by Justyna Petke
Cover of the book Big Data Analytics and Knowledge Discovery by Justyna Petke
Cover of the book ICT for a Better Life and a Better World by Justyna Petke
Cover of the book Labour Standards in International Economic Law by Justyna Petke
Cover of the book Bridging the Gap between Life and Physics by Justyna Petke
Cover of the book The Soils of Antarctica by Justyna Petke
Cover of the book Philosophical Explorations of the Legacy of Alan Turing 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