Constraint Satisfaction Problems

• CSP = Constraint Satisfaction Problems

• A CSP consists of:

  • a set of variables, X
  • for each variable xi in X, a domain Di
    • Di is a finite set of possible values
  • a set of constraints restricting tuples of values
    • if only pairs of values, it’s a binary CSP

• A solution is an assignment of a value in Di to each variable xi such that every constraint satisfied

Previous slide

Next slide

Back to first slide

View graphic version