Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction.
Manuel BodirskyAntoine MottetPublished in: LICS (2016)
Keyphrases
- constraint satisfaction
- finite domain
- constraint satisfaction problems
- constraint programming
- constraint propagation
- constraint solving
- constraint solver
- combinatorial problems
- rough sets
- np complete
- constraint logic programming
- arc consistency
- phase transition
- constraint problems
- search space
- constraint relaxation
- non binary
- heuristic search
- robust fault detection
- russian doll search
- finite number
- soft constraints
- orders of magnitude
- constraint networks
- temporal constraints
- bounded treewidth
- logic programming