Constraint Satisfaction Problem (CSP)
NTT Communication Science Labs.
Definition:
- variables (x1, x2, ...) and domains (D1, D2, ...)
- constraints a constraint is represented as a nogood: a combination of variable values that is prohibited
Goal:
- to find the value assignment for the variables that satisfies all of the constraints