Bridging Constraint Satisfaction and Boolean Satisfiability - Justyna Petke
-30% ar kodu BOOKS
Piegāde 10-16 darba dienu laikā
30 dienu atgriešanas politika
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 satisf ... Pilns apraksts
Jums varētu patikt arī
TOP
If Anyone Builds It, Everyone Dies: Why Superhuman AI Would Kill Us All
Eliezer Yudkowsky, Nate Soares
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
How To Think About AI: A Guide For The Perplexed
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Gödel, Escher, Bach: An Eternal Golden Braid
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
AI Engineering: Building Applications with Foundation Models
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Empire of AI: Dreams and Nightmares in Sam Altman's OpenAI
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Rust Programming Language
Steve Klabnik, Carol Nichols, Chris Krycho
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Art of Game Design: A Book of Lenses
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Pragmatic Programmer: journey to mastery, 20th Anniversary Edition, 2/e: your journey to mastery, 20th Anniversary Edition
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Python Crash Course: A Hands-On, Project-Based Introduction to Programming
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
HBR Guide to Generative AI for Managers
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Hackers. 25th Anniversary Edition: Heroes of the Computer Revolution
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
How Linux Works: What Every Superuser Should Know
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Hands-On Large Language Models: Language Understanding and Generation
Maarten Grootendorst, Jay Alammar
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Fundamentals of Software Architecture: A Modern Engineering Approach
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Speak Data: Artists, Scientists, Thinkers, and Dreamers on How We Live Our Lives in Numbers
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
World of Warcraft Chronicle, Volume 2
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Linux Basics for Hackers, 2nd Edition: Getting Started with Networking, Scripting, and Security in Kali
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
Deep Learning: Foundations and Concepts
Christopher M. Bishop, Hugh Bishop
-30% ar kodu BOOKS
Piegādātāja noliktavā
TOP
The Linux Programming Interface: A Linux and UNIX System Programming Handbook
-30% ar kodu BOOKS
Piegādātāja noliktavā
Aprašymas
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.
Vairāk informācijas
| Autors | Justyna Petke |
|---|---|
| Izdevējs | Springer International Publishing |
| Izlaides gads | 2016 |
| Vāka tips | Mīkstais vāks |
| EAN | 9783319373645 |