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...
Uloženo v:
| Hlavní autor: | Petke, Justyna. (Autor, http://id.loc.gov/vocabulary/relators/aut) |
|---|---|
| Korporativní autor: | SpringerLink (Online service) |
| Médium: | Elektronický zdroj E-kniha |
| Jazyk: | English |
| Vydáno: |
Cham :
Springer International Publishing : Imprint: Springer,
2015.
|
| Vydání: | 1st ed. 2015. |
| Edice: | Artificial Intelligence: Foundations, Theory, and Algorithms,
|
| Témata: | |
| On-line přístup: | https://doi.org/10.1007/978-3-319-21810-6 |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo otaguje tento záznam!
|
Podobné jednotky
-
Constraint Satisfaction Techniques for Agent-Based Reasoning
Autor: Neagu, Nicoleta., a další
Vydáno: (2005) -
Constraint Solving and Planning with Picat
Autor: Zhou, Neng-Fa., a další
Vydáno: (2015) -
Linear Genetic Programming
Autor: Brameier, Markus F., a další
Vydáno: (2007) -
Theory and Applications of Formal Argumentation Second International Workshop, TAFA 2013, Beijing, China, August 3-5, 2013, Revised Selected Papers /
Vydáno: (2014) -
Robust Intelligent Systems
Vydáno: (2008)



