Bridging Constraint Satisfaction and Boolean Satisfiability - Justyna Petke
-20% with code BOOKS
Shipping in 17-23 days
30-day return policy
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 satis ... Full description
You May Also Like
TOP
Gödel, Escher, Bach: An Eternal Golden Braid
-20% with code BOOKS
In stock at our supplier
TOP
If Anyone Builds It, Everyone Dies: Why Superhuman AI Would Kill Us All
Eliezer Yudkowsky, Nate Soares
-20% with code BOOKS
In stock at our supplier
TOP
AI Engineering: Building Applications with Foundation Models
-20% with code BOOKS
In stock at our supplier
TOP
The Rust Programming Language
Steve Klabnik, Carol Nichols, Chris Krycho
-20% with code BOOKS
In stock at our supplier
TOP
The Art of Game Design: A Book of Lenses
-20% with code BOOKS
In stock at our supplier
TOP
How To Think About AI: A Guide For The Perplexed
-20% with code BOOKS
In stock at our supplier
TOP
Empire of AI: Dreams and Nightmares in Sam Altman's OpenAI
-20% with code BOOKS
In stock at our supplier
TOP
The Pragmatic Programmer: journey to mastery, 20th Anniversary Edition, 2/e: your journey to mastery, 20th Anniversary Edition
-20% with code BOOKS
In stock at our supplier
TOP
HBR Guide to Generative AI for Managers
-20% with code BOOKS
In stock at our supplier
TOP
The Web Application Hacker's Handbook: Discovering and Exploiting Security Flaws
-20% with code BOOKS
In stock at our supplier
TOP
How Linux Works: What Every Superuser Should Know
-20% with code BOOKS
In stock at our supplier
TOP
Artificial Intelligence: A Modern Approach, Global Edition
-20% with code BOOKS
In stock at our supplier
TOP
Python Crash Course: A Hands-On, Project-Based Introduction to Programming
-20% with code BOOKS
In stock at our supplier
TOP
Fundamentals of Software Architecture: A Modern Engineering Approach
-20% with code BOOKS
In stock at our supplier
TOP
Speak Data: Artists, Scientists, Thinkers, and Dreamers on How We Live Our Lives in Numbers
-20% with code BOOKS
In stock at our supplier
TOP
Linux Basics for Hackers, 2nd Edition: Getting Started with Networking, Scripting, and Security in Kali
-20% with code BOOKS
In stock at our supplier
TOP
C Programming Language
Brian W. Kernighan, Brian Kernighan, Dennis Ritchie
-20% with code BOOKS
In stock at our supplier
TOP
Hackers. 25th Anniversary Edition: Heroes of the Computer Revolution
-20% with code BOOKS
In stock at our supplier
TOP
Proofs from THE BOOK
Martin Aigner, Günter M. Ziegler
-20% with code BOOKS
In stock at our supplier
Description
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 Information
| Author | Justyna Petke |
|---|---|
| Publisher | Springer Nature Switzerland |
| Series | Artificial Intelligence: Foundations, Theory, and Algorithms |
| Release year | 2015 |
| Cover type | Hardcover |
| EAN | 9783319218090 |