Contact
Comment faire ses achats
Livraison
Guide d'achat
Bridging Constraint Satisfaction and Boolean Satisfiability
Anglais
148 b
Livraison à Autriche
Jusqu'à 30 jours pour les retours
Les clients ont également acheté
/
Livre de poche
16.09
€
/
Livre relié
19.69
€
/
Livre de poche
14.69
€
/
Livre de poche
27.69
€
/
Livre de poche
47.95
€
/
Livre de poche
13.19
€
/
Livre de poche
68.00
€
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.
À propos du livre
Anglais
Offrez ce livre dès aujourd'hui
C’est simple
1 Ajouter au panier et choisir l'option Livrer comme cadeau à la caisse. 2 Nous vous enverrons un bon d'achat 3 Le livre arrivera à l'adresse du destinataireCeci pourrait également vous intéresser
Bonjour ! Je suis Libroamiko, votre conseiller littéraire.
Comment puis-je vous aider ?