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...
| Main Author: | Petke, Justyna (Author) |
|---|---|
| Corporate Author: | SpringerLink (Online service) |
| Format: | Electronic eBook |
| Language: | English |
| Published: |
Cham :
Springer International Publishing : Imprint: Springer,
2015.
|
| Edition: | 1st ed. 2015. |
| Series: | Artificial Intelligence: Foundations, Theory, and Algorithms,
|
| Subjects: | |
| Online Access: | Full Text via HEAL-Link |
Similar Items
-
Constraint Satisfaction Techniques for Agent-Based Reasoning
by: Neagu, Nicoleta
Published: (2005) -
The Complexity of Valued Constraint Satisfaction Problems
by: Živný, Stanislav
Published: (2012) -
Constraint Solving and Planning with Picat
by: Zhou, Neng-Fa, et al.
Published: (2015) -
Multiparadigm Constraint Programming Languages
by: Hofstedt, Petra
Published: (2011) -
Theory and Applications of Satisfiability Testing -- SAT 2015 18th International Conference, Austin, TX, USA, September 24-27, 2015, Proceedings /
Published: (2015)