Reasoning Short Cuts in Infinite Domain Constraint Satisfaction: Algorithms and Lower Bounds for Backdoors.
Peter JonssonVictor LagerkvistSebastian OrdyniakPublished in: CP (2021)
Keyphrases
- constraint satisfaction
- lower bound
- constraint satisfaction problems
- combinatorial problems
- phase transition
- russian doll search
- orders of magnitude
- constraint optimization
- computational complexity
- constraint programming
- sat solvers
- constraint problems
- constraint propagation
- search strategies
- heuristic search
- worst case
- upper bound
- learning algorithm
- probabilistic reasoning
- forward checking
- constraint relaxation
- machine learning
- soft constraints
- relaxation labeling
- constrained problems
- random instances
- search algorithm
- backtrack search