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

Descripción completa

Guardado en:
Detalles Bibliográficos
Autor Principal: Petke, Justyna. (Autor, http://id.loc.gov/vocabulary/relators/aut)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Lenguaje:English
Publicado: Cham : Springer International Publishing : Imprint: Springer, 2015.
Edición:1st ed. 2015.
Series:Artificial Intelligence: Foundations, Theory, and Algorithms,
Materias:
Acceso en línea:https://doi.org/10.1007/978-3-319-21810-6
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares