A complexity dichotomy for poset constraint satisfaction.
Michael KompatscherVan Trung PhamPublished in: CoRR (2016)
Keyphrases
- bayesian networks
- constraint satisfaction
- constraint satisfaction problems
- probabilistic reasoning
- heuristic search
- constraint programming
- arc consistency
- relaxation labeling
- phase transition
- constraint propagation
- combinatorial problems
- robust fault detection
- constrained problems
- russian doll search
- constraint relaxation
- constraint solving
- constraint networks
- soft constraints
- partial order
- product configuration
- computational complexity
- search strategies
- state space
- non binary
- np complete
- np hard