Topology is irrelevant (in a dichotomy conjecture for infinite domain constraint satisfaction problems).
Libor BartoMichael PinskerPublished in: CoRR (2019)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- np complete
- constraint programming
- search space
- non binary
- computational problems
- np hard
- sat problem
- combinatorial problems
- solving constraint satisfaction problems
- constraint solving
- decomposition methods
- constraint networks
- arc consistency
- domain independent
- domain specific
- constraint solver
- tractable classes
- forward checking
- soft constraints
- partial constraint satisfaction
- constraint optimization
- constraint problems
- temporal constraints
- backtracking algorithm
- finite domain
- backtracking search
- tractable subclasses
- set bounds propagation