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 Microbiota of the Human Body by Justyna Petke
Cover of the book Good Laboratory Practices for Forensic Chemistry by Justyna Petke
Cover of the book Divergence and Convergence of Automobile Fuel Economy Regulations by Justyna Petke
Cover of the book Excel 2016 for Environmental Sciences Statistics by Justyna Petke
Cover of the book A Semidiscrete Version of the Citti-Petitot-Sarti Model as a Plausible Model for Anthropomorphic Image Reconstruction and Pattern Recognition by Justyna Petke
Cover of the book Public Health Intelligence by Justyna Petke
Cover of the book Arabic Science Fiction by Justyna Petke
Cover of the book Climate of the Romanian Carpathians by Justyna Petke
Cover of the book Environmental Biomedicine by Justyna Petke
Cover of the book Quantum Computational Number Theory by Justyna Petke
Cover of the book The Future of Work in Information Society by Justyna Petke
Cover of the book Ambient Intelligence– Software and Applications – 8th International Symposium on Ambient Intelligence (ISAmI 2017) by Justyna Petke
Cover of the book Smart Intelligent Aircraft Structures (SARISTU) by Justyna Petke
Cover of the book International Relations in Poland by Justyna Petke
Cover of the book Cloud Computing and Security 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