Exploiting Interchangeabilities in Constraint-Satisfaction Problems.
Alois HaselböckPublished in: IJCAI (1993)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- search space
- constraint programming
- constraint propagation
- np complete
- computational problems
- non binary
- np hard
- combinatorial problems
- constraint solving
- arc consistency
- product configuration
- soft constraints
- constraint optimization
- finite domain
- constraint networks
- global constraints
- forward checking
- branch and bound algorithm
- weighted constraint satisfaction
- decomposition methods
- sat problem
- backtracking search
- solving constraint satisfaction problems
- finding optimal solutions
- partial constraint satisfaction
- disjunctive temporal
- dynamic constraint satisfaction problems