Modelling Exceptionally Hard Constraint Satisfaction Problems.
Barbara M. SmithStuart A. GrantPublished in: CP (1997)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- graph coloring problems
- constraint propagation
- constraint programming
- random instances
- search space
- non binary
- np complete
- combinatorial problems
- arc consistency
- np hard
- computational problems
- constraint solving
- global constraints
- product configuration
- decomposition methods
- constraint problems
- sat problem
- reasoning problems
- solving constraint satisfaction problems
- finite domain
- forward checking
- constraint solvers
- temporal constraints
- optimal solution
- soft constraints
- hard problems
- constraint networks
- sat encodings
- constraint graph
- constraint optimization
- finding optimal solutions
- disjunctive temporal