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 Homeopathy - The Undiluted Facts by Justyna Petke
Cover of the book Early Vocal Contact and Preterm Infant Brain Development by Justyna Petke
Cover of the book Understanding Child Neglect by Justyna Petke
Cover of the book Entrepreneurship in Family Business by Justyna Petke
Cover of the book The Saudi Arabian Monetary Agency, 1952-2016 by Justyna Petke
Cover of the book Glial Amino Acid Transporters by Justyna Petke
Cover of the book Stable and Efficient Cubature-based Filtering in Dynamical Systems by Justyna Petke
Cover of the book The Siberian Sturgeon (Acipenser baerii, Brandt, 1869) Volume 1 - Biology by Justyna Petke
Cover of the book Listen and Talk by Justyna Petke
Cover of the book Computer Vision, Graphics, and Image Processing by Justyna Petke
Cover of the book Governing Human Well-Being by Justyna Petke
Cover of the book European Yearbook of International Economic Law 2016 by Justyna Petke
Cover of the book Foot Patrol by Justyna Petke
Cover of the book Reviews on Biomarker Studies in Psychiatric and Neurodegenerative Disorders by Justyna Petke
Cover of the book Theoretical Frontiers in Black Holes and Cosmology 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