On the Computation of Local Interchangeability in Soft Constraint Satisfaction Problems.
Nicoleta NeaguStefano BistarelliBoi FaltingsPublished in: FLAIRS Conference (2003)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- hard constraints
- constraint programming
- constraint propagation
- search space
- np complete
- np hard
- constraint solving
- non binary
- soft constraints
- decomposition methods
- combinatorial problems
- global constraints
- arc consistency
- arithmetic constraints
- temporal constraints
- solving constraint satisfaction problems
- product configuration
- constraint networks
- tractable subclasses
- sat problem
- forward checking
- backtracking search
- finding optimal solutions
- partial constraint satisfaction
- constraint solver
- backtracking algorithm
- computational problems
- computational complexity