The Dichotomy for Conservative Constraint Satisfaction is Polynomially Decidable.
Clément CarbonnelPublished in: CoRR (2016)
Keyphrases
- constraint satisfaction
- constraint satisfaction problems
- np complete
- heuristic search
- relaxation labeling
- constraint propagation
- constraint programming
- phase transition
- constraint relaxation
- combinatorial problems
- product configuration
- probabilistic reasoning
- russian doll search
- soft constraints
- constraint networks
- constraint solving
- arc consistency
- first order logic
- dnf formulas
- robust fault detection
- search space