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 Applications and Usability of Interactive Television by Justyna Petke
Cover of the book Rice Production Worldwide by Justyna Petke
Cover of the book Systemic Vasculitides: Current Status and Perspectives by Justyna Petke
Cover of the book Software Technologies: Applications and Foundations by Justyna Petke
Cover of the book New Frontiers in Mining Complex Patterns by Justyna Petke
Cover of the book Rheophysics by Justyna Petke
Cover of the book Teaching and Learning in a Digital World by Justyna Petke
Cover of the book Cancer Neurology in Clinical Practice by Justyna Petke
Cover of the book In Defense of Deflation by Justyna Petke
Cover of the book Distributed, Ambient and Pervasive Interactions by Justyna Petke
Cover of the book Evolutionary Perspectives on Child Development and Education by Justyna Petke
Cover of the book Recent Advances in Systems, Control and Information Technology by Justyna Petke
Cover of the book Cloud Computing and Services Science by Justyna Petke
Cover of the book Sequential Experiments with Primes by Justyna Petke
Cover of the book Protein Conformational Dynamics 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