How to Classify Hard and Soft Constraints in Non-binary Constraint Satisfaction Problems.
Miguel A. SalidoFederico BarberPublished in: SGAI Conf. (2003)
Keyphrases
- constraint satisfaction problems
- non binary
- hard and soft constraints
- constraint programming
- soft constraints
- hard constraints
- constraint satisfaction
- arc consistency
- constraint propagation
- search space
- integrity checking
- global constraints
- np complete
- np hard
- constraint networks
- constraint solving
- forward checking
- backtracking algorithms
- constraint logic programming
- backtracking search
- search algorithm
- temporal constraints
- computational complexity