Context in Discrete Constraint Satisfaction Problems.
Rainer WeigelBoi FaltingsBerthe Y. ChoueiryPublished in: ECAI (1996)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- constraint propagation
- np complete
- constraint programming
- search space
- non binary
- combinatorial problems
- np hard
- arc consistency
- tractable subclasses
- constraint solving
- computational problems
- constraint networks
- arithmetic constraints
- constraint optimization
- global constraints
- constraint problems
- search algorithm
- solving constraint satisfaction problems
- backtracking search
- random instances
- reasoning problems
- special case
- decomposition methods
- phase transition
- product configuration
- finite domain
- forward checking
- constraint graph
- tractable classes
- branch and bound algorithm
- soft constraints
- sat problem
- finding optimal solutions