The complexity of Boolean constraint satisfaction local search problems.
Philippe ChapdelaineNadia CreignouPublished in: Ann. Math. Artif. Intell. (2005)
Keyphrases
- constraint satisfaction
- constraint satisfaction problems
- constrained problems
- combinatorial problems
- heuristic search
- russian doll search
- soft constraints
- hard constraints
- constraint propagation
- constraint programming
- search space
- optimization problems
- constraint problems
- phase transition
- relaxation labeling
- sat solvers
- propositional satisfiability
- combinatorial optimization
- probabilistic reasoning
- backtracking algorithms
- mathematical programming
- product configuration
- constraint solving
- configuration problems
- constraint optimization
- computational complexity
- constraint relaxation
- max csp
- search heuristics
- np complete