The Dichotomy for Conservative Constraint Satisfaction is Polynomially Decidable.
Clément CarbonnelPublished in: CP (2016)
Keyphrases
- constraint satisfaction
- constraint satisfaction problems
- np complete
- constraint programming
- relaxation labeling
- constraint propagation
- phase transition
- first order logic
- russian doll search
- constraint relaxation
- heuristic search
- probabilistic reasoning
- combinatorial problems
- constraint problems
- robust fault detection
- constraint solving
- decision support
- sat solvers
- fuzzy logic
- soft constraints
- np hard
- special case
- lower bound