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...
Guardado en:
| 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
-
Constraint Satisfaction Techniques for Agent-Based Reasoning
por: Neagu, Nicoleta., et al.
Publicado: (2005) -
Constraint Solving and Planning with Picat
por: Zhou, Neng-Fa., et al.
Publicado: (2015) -
Linear Genetic Programming
por: Brameier, Markus F., et al.
Publicado: (2007) -
Theory and Applications of Formal Argumentation Second International Workshop, TAFA 2013, Beijing, China, August 3-5, 2013, Revised Selected Papers /
Publicado: (2014) -
Robust Intelligent Systems
Publicado: (2008)



