On the Computation of Local Interchangeability in Discrete Constraint Satisfaction Problems.
Berthe Y. ChoueiryGuevara NoubirPublished in: AAAI/IAAI (1998)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint programming
- combinatorial problems
- search space
- constraint propagation
- constraint solving
- np hard
- np complete
- arc consistency
- non binary
- tractable subclasses
- soft constraints
- solving constraint satisfaction problems
- disjunctive temporal
- constraint networks
- reasoning problems
- forward checking
- constraint optimization
- computational problems
- ordering heuristics
- product configuration
- constraint problems
- finite domain
- constraint solvers
- partial constraint satisfaction
- search algorithm