The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems.
Libor BartoMichael PinskerPublished in: LICS (2016)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint programming
- combinatorial problems
- search space
- constraint propagation
- soft constraints
- non binary
- np hard
- np complete
- constraint solving
- product configuration
- tractable classes
- computational problems
- arc consistency
- domain independent
- constraint problems
- constraint networks
- domain specific
- constraint solver
- solving constraint satisfaction problems
- disjunctive temporal
- partial constraint satisfaction
- finding optimal solutions
- constraint optimization
- temporal constraints
- forward checking
- arithmetic constraints
- reasoning problems
- decomposition methods
- objective function