Two Approaches for Finite-Domain Constraint Satisfaction Problems - CP and CMGTP.
Yasuyuki ShiraiRyuzo HasegawaPublished in: ICLP (1995)
Keyphrases
- constraint satisfaction problems
- finite domain
- constraint programming
- constraint propagation
- constraint satisfaction
- constraint solving
- decomposition methods
- search space
- np complete
- constraint solver
- combinatorial problems
- global constraints
- constraint logic programming
- non binary
- soft constraints
- search strategies
- arc consistency
- forward checking
- constraint problems
- ordering heuristics
- constraint networks
- np hard