The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems.
Libor BartoMichael PinskerPublished in: CoRR (2016)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint programming
- constraint propagation
- np complete
- non binary
- combinatorial problems
- search space
- domain specific
- np hard
- constraint solving
- arc consistency
- computational problems
- decomposition methods
- soft constraints
- global constraints
- constraint problems
- tractable subclasses
- finite domain
- pseudo boolean optimization
- disjunctive temporal
- backtracking search
- tractable classes
- backtracking algorithm
- forward checking
- product configuration
- domain independent
- symmetry breaking
- constraint optimization
- arc consistency algorithm
- solving constraint satisfaction problems
- arithmetic constraints
- randomly generated
- difficult problems
- sat problem