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 Distributed Optimization-Based Control of Multi-Agent Networks in Complex Environments by Justyna Petke
Cover of the book Vladimir Solov’ëv's Justification of the Moral Good by Justyna Petke
Cover of the book Tourists in Space by Justyna Petke
Cover of the book Fundamentals of Spherical Array Processing by Justyna Petke
Cover of the book Rethinking Taxation in Latin America by Justyna Petke
Cover of the book Advances in REBT by Justyna Petke
Cover of the book Global Perspectives on Women's Sexual and Reproductive Health Across the Lifecourse by Justyna Petke
Cover of the book The Impact of Cleavages on Swiss Voting Behaviour by Justyna Petke
Cover of the book Nonlinear Dynamics, Volume 2 by Justyna Petke
Cover of the book Coupling and Decoupling of Diverse Molecular Units in Glycosciences by Justyna Petke
Cover of the book Aviation and Climate Change by Justyna Petke
Cover of the book ECSCW 2015: Proceedings of the 14th European Conference on Computer Supported Cooperative Work, 19-23 September 2015, Oslo, Norway by Justyna Petke
Cover of the book Use of Extraterrestrial Resources for Human Space Missions to Moon or Mars by Justyna Petke
Cover of the book Open Data for Education by Justyna Petke
Cover of the book Black Masculinity and the Cinema of Policing 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