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 Serious Games, Interaction, and Simulation by Justyna Petke
Cover of the book Diaspora and Media in Europe by Justyna Petke
Cover of the book Improving Sustainability During Hospital Design and Operation by Justyna Petke
Cover of the book Challenging the Paradoxes of Integration Policies by Justyna Petke
Cover of the book Lasers with Nuclear Pumping by Justyna Petke
Cover of the book Commonsense Pluralism about Truth by Justyna Petke
Cover of the book Search for Supersymmetry in pp Collisions at √s = 8 TeV with a Photon, Lepton, and Missing Transverse Energy by Justyna Petke
Cover of the book Road Vehicle Automation 4 by Justyna Petke
Cover of the book Smooth Bézier Surfaces over Unstructured Quadrilateral Meshes by Justyna Petke
Cover of the book Service Business Model Innovation in Healthcare and Hospital Management by Justyna Petke
Cover of the book Societies under Construction by Justyna Petke
Cover of the book Inclusive Smart Cities and Digital Health by Justyna Petke
Cover of the book Geometric Continuum Mechanics and Induced Beam Theories by Justyna Petke
Cover of the book Formal Methods for Multicore Programming by Justyna Petke
Cover of the book Cognitive Radio Oriented Wireless Networks 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