Bridging Constraint Satisfaction and Boolean Satisfiability

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 theoretica...

Description complète

Enregistré dans:
Détails bibliographiques
Auteur principal: Petke, Justyna. (Auteur, http://id.loc.gov/vocabulary/relators/aut)
Collectivité auteur: SpringerLink (Online service)
Format: Électronique eBook
Langue:English
Publié: Cham : Springer International Publishing : Imprint: Springer, 2015.
Édition:1st ed. 2015.
Collection:Artificial Intelligence: Foundations, Theory, and Algorithms,
Sujets:
Accès en ligne:https://doi.org/10.1007/978-3-319-21810-6
Tags: Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!