Téléchargez le livre : Bridging Constraint Satisfaction and Boolean Satisfiability

Bridging Constraint Satisfaction and Boolean Satisfiability

de

Éditeur :

Springer


Collection :

Artificial Intelligence: Foundations, Theory, and Algorithms

Paru le : 2015-08-25

eBook Téléchargement , DRM LCP 🛈 DRM Adobe 🛈
Lecture en ligne (streaming)
52,74 €
Téléchargement immédiat
Dès validation de votre commande
Image Louise Reader présentation

Louise Reader

Lisez ce titre sur l'application Louise Reader.

badge apple Application Louise Reader
badge Android Application Louise Reader
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. 
Pages
113 pages
Collection
Artificial Intelligence: Foundations, Theory, and Algorithms
Parution
2015-08-25
Marque
Springer
EAN papier
9783319218090
EAN PDF
9783319218106
Informations sur l'ebook
Nombre pages copiables
1
Nombre pages imprimables
11
Taille du fichier
1731 Ko
Prix
52,74 €
EAN EPUB
9783319218106
Informations sur l'ebook
Nombre pages copiables
1
Nombre pages imprimables
11
Taille du fichier
768 Ko
Prix
52,74 €

Suggestions personnalisées