Topology is relevant (in a dichotomy conjecture for infinite-domain constraint satisfaction problems).
Manuel BodirskyAntoine MottetMiroslav OlsákJakub OprsalMichael PinskerRoss WillardPublished in: LICS (2019)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint programming
- np complete
- constraint propagation
- search space
- constraint solving
- combinatorial problems
- decomposition methods
- non binary
- arc consistency
- constraint networks
- computational problems
- solving constraint satisfaction problems
- np hard
- finite domain
- product configuration
- arc consistency algorithm
- forward checking
- pseudo boolean optimization
- domain specific
- soft constraints
- constraint problems
- temporal constraints
- backtracking search
- domain independent
- lower bound
- path consistency
- symmetry breaking
- reasoning problems
- global constraints
- partial constraint satisfaction