The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 22201).
Martin GroheVenkatesan GuruswamiDániel MarxStanislav ZivnýPublished in: Dagstuhl Reports (2022)
Keyphrases
- disjunctive temporal
- constraint satisfaction problems
- constraint satisfaction
- constraint programming
- constraint propagation
- np complete
- search space
- constraint solving
- soft constraints
- constraint networks
- non binary
- arc consistency
- decomposition methods
- np hard
- forward checking
- computational complexity
- approximation algorithms
- worst case
- hard constraints
- special case
- pseudo boolean optimization
- phase transition
- global constraints
- sat problem
- product configuration
- constraint solver
- constraint graph
- backtracking algorithm