The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 15301).
Andrei A. BulatovVenkatesan GuruswamiAndrei A. KrokhinDániel MarxPublished in: Dagstuhl Reports (2015)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- constraint solving
- arc consistency
- np complete
- constraint programming
- search space
- partial constraint satisfaction
- constraint problems
- decomposition methods
- non binary
- computational complexity
- space complexity
- soft constraints
- approximation algorithms
- tractable subclasses
- temporal constraints
- hard constraints
- worst case
- finite domain
- np hard
- sat problem
- heuristic search
- symmetry breaking
- constraint graph
- distributed constraint satisfaction problems
- distributed constraint satisfaction