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...
Clasificación: | Libro Electrónico |
---|---|
Autor principal: | Petke, Justyna (Autor) |
Autor Corporativo: | SpringerLink (Online service) |
Formato: | Electrónico eBook |
Idioma: | Inglés |
Publicado: |
Cham :
Springer International Publishing : Imprint: Springer,
2015.
|
Edición: | 1st ed. 2015. |
Colección: | Artificial Intelligence: Foundations, Theory, and Algorithms,
|
Temas: | |
Acceso en línea: | Texto Completo |
Ejemplares similares
-
Constraint Satisfaction Techniques for Agent-Based Reasoning
por: Neagu, Nicoleta
Publicado: (2005) -
Constraint Solving and Planning with Picat
por: Zhou, Neng-Fa, et al.
Publicado: (2015) -
The Complexity of Valued Constraint Satisfaction Problems
por: Živný, Stanislav
Publicado: (2012) -
Multiparadigm Constraint Programming Languages
por: Hofstedt, Petra
Publicado: (2011) -
Recent Advances in Constraints 11th Annual ERCIM International Workshop on Constraint Solving and Constraint Logic Programming, CSCLP 2006 Caparica, Portugal, June 26-28, 2006 Revised Selected and Invited Papers /
Publicado: (2007)