Cargando…

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

Detalles Bibliográficos
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