Maximal Sets of Solutions for Constraint Satisfaction Problems.
David LesaintPublished in: ECAI (1994)
Keyphrases
- constraint satisfaction problems
- combinatorial problems
- constraint satisfaction
- solving constraint satisfaction problems
- constraint programming
- hyper heuristics
- finding optimal solutions
- constraint propagation
- backtrack search
- non binary
- dynamic constraint satisfaction problems
- graph coloring problems
- np complete
- arc consistency
- search space
- configuration problems
- np hard
- soft constraints
- product configuration
- constraint solving
- computational problems
- backtracking search
- partial constraint satisfaction
- sat problem
- partial assignment
- symmetry breaking
- constraint problems
- reasoning problems
- finite domain
- random instances
- temporal constraints
- phase transition