Complexity of Combinations of Qualitative Constraint Satisfaction Problems.
Manuel BodirskyJohannes GreinerPublished in: IJCAR (2018)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- tractable subclasses
- constraint programming
- constraint propagation
- np complete
- non binary
- search space
- qualitative spatial and temporal reasoning
- combinatorial problems
- np hard
- arc consistency
- decomposition methods
- soft constraints
- computational complexity
- constraint solving
- solving constraint satisfaction problems
- computational problems
- constraint optimization
- interval algebra
- reasoning problems
- temporal constraints
- worst case
- finite domain
- constraint graph
- backtracking algorithm
- constraint problems
- disjunctive constraints
- partial constraint satisfaction
- qualitative and quantitative
- disjunctive temporal