Bridging Constraint Satisfaction and Boolean Satisfiability - Justyna Petke
-25% koodilla BOOKS
Toimitus 17-23 arkipäivässä
30 päivän palautusoikeus
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 ... Täydellinen kuvaus
Saatat myös pitää
TOP
Gödel, Escher, Bach: An Eternal Golden Braid
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Hackers. 25th Anniversary Edition: Heroes of the Computer Revolution
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
The Web Application Hacker's Handbook: Discovering and Exploiting Security Flaws
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
The Pragmatic Programmer: journey to mastery, 20th Anniversary Edition, 2/e: your journey to mastery, 20th Anniversary Edition
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Mathematics for Machine Learning
Cheng Soon Ong, A. Aldo Faisal, Marc Peter Deisenroth
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
The Art of Game Design: A Book of Lenses
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
How Linux Works: What Every Superuser Should Know
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Artificial Intelligence: A Modern Approach, Global Edition
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Linux Basics for Hackers, 2nd Edition: Getting Started with Networking, Scripting, and Security in Kali
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
AI Engineering: Building Applications with Foundation Models
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Fundamentals of Software Architecture: A Modern Engineering Approach
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
How To Think About AI: A Guide For The Perplexed
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Empire of AI: Dreams and Nightmares in Sam Altman's OpenAI
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
HBR Guide to Generative AI for Managers
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Speak Data: Artists, Scientists, Thinkers, and Dreamers on How We Live Our Lives in Numbers
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
If Anyone Builds It, Everyone Dies: Why Superhuman AI Would Kill Us All
Eliezer Yudkowsky, Nate Soares
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
The Rust Programming Language
Steve Klabnik, Carol Nichols, Chris Krycho
-25% koodilla BOOKS
Toimittajalla varastossa
Kuvaus
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.
Lisätietoja
| Kirjoittaja | Justyna Petke |
|---|---|
| Julkaisija | Springer Nature Switzerland |
| Series | Artificial Intelligence: Foundations, Theory, and Algorithms |
| Julkaisuvuosi | 2015 |
| Kannen tyyppi | Kovakantinen |
| EAN | 9783319218090 |