The Complexity of Combinations of Qualitative Constraint Satisfaction Problems.
Manuel BodirskyJohannes GreinerPublished in: Log. Methods Comput. Sci. (2020)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- tractable subclasses
- constraint programming
- constraint propagation
- qualitative spatial and temporal reasoning
- np hard
- search space
- non binary
- arc consistency
- np complete
- combinatorial problems
- constraint solving
- space complexity
- computational complexity
- constraint networks
- constraint solver
- forward checking
- temporal constraints
- global constraints
- soft constraints
- computational problems
- worst case
- search tree
- finite domain
- backtracking algorithm
- dynamic constraint satisfaction problems
- pseudo boolean optimization
- arc consistency algorithm
- tractable classes
- random instances
- reasoning problems
- constraint problems
- qualitative and quantitative
- decision problems
- lower bound