Studying Interchangeability in Constraint Satisfaction Problems.
Nicoleta NeaguPublished in: CP (2002)
Keyphrases
- constraint satisfaction problems
- constraint satisfaction
- search space
- constraint programming
- np hard
- combinatorial problems
- np complete
- constraint propagation
- non binary
- computational problems
- arc consistency
- constraint networks
- product configuration
- constraint solving
- partial constraint satisfaction
- finite domain
- decomposition methods
- forward checking
- arc consistency algorithm
- hard constraints
- arithmetic constraints
- graph coloring problems
- soft constraints
- sat problem
- constraint solver
- temporal logic
- constraint graph
- constraint optimization
- finding optimal solutions
- orders of magnitude
- disjunctive temporal
- pseudo boolean optimization