Complexity of Combinations of Qualitative Constraint Satisfaction Problems.
Manuel BodirskyJohannes GreinerPublished in: CoRR (2018)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- tractable subclasses
- constraint propagation
- constraint programming
- np complete
- qualitative spatial and temporal reasoning
- search space
- combinatorial problems
- arc consistency
- constraint solving
- non binary
- np hard
- computational problems
- computational complexity
- backtracking search
- soft constraints
- constraint networks
- worst case
- constraint problems
- constraint solver
- solving constraint satisfaction problems
- space complexity
- global constraints
- forward checking
- decision problems
- arc consistency algorithm
- temporal constraints