The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems.
Libor BartoMichael KompatscherMiroslav OlsákTrung Van PhamMichael PinskerPublished in: LICS (2017)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- np complete
- constraint programming
- combinatorial problems
- search space
- computational problems
- non binary
- constraint solving
- constraint networks
- domain specific
- arc consistency
- np hard
- global constraints
- decomposition methods
- constraint graph
- backtracking algorithm
- solving constraint satisfaction problems
- finite domain
- constraint optimization
- backtracking search
- temporal constraints
- sat problem
- domain independent
- state space
- forward checking
- arc consistency algorithm
- pseudo boolean optimization