You might also like

More about Bridging Constraint Satisfaction and Boolean Satisfiability

• Book details
• Synopsis
• Trending among others

You get 135 loyalty points

Book synopsis

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.

Book details

Book category Books in English Computing & information technology Computer science Artificial intelligence

• Full title: Bridging Constraint Satisfaction and Boolean Satisfiability
• Author: Justyna Petke
• Language: English
• Binding: Paperback
• Number of pages: 113
• EAN: 9783319373645
• ISBN: 9783319373645
• ID: 15368821
• Publisher: Springer International Publishing AG
• Weight: 2058 g
• Dimensions: 235 × 155 × 8 mm
• Date of publishing: 22. October 2016

Trending among others

---

---

---