The Constraint Satisfaction Problem: Complexity and Approximability (Dagstuhl Seminar 18231).
Martin GroheVenkatesan GuruswamiStanislav ZivnýPublished in: Dagstuhl Reports (2018)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- np complete
- non binary
- constraint programming
- search space
- arc consistency
- worst case
- decomposition methods
- constraint solving
- finite domain
- computational complexity
- np hard
- partial constraint satisfaction
- disjunctive temporal
- sat problem
- soft constraints
- constraint networks
- global constraints
- product configuration
- constraint problems
- forward checking
- distributed constraint satisfaction problems
- finding optimal solutions
- temporal constraints
- approximation algorithms
- space complexity
- hypertree decomposition
- distributed constraint satisfaction
- problems in artificial intelligence
- pseudo boolean optimization