Example: quiz answers

Constraint Satisfaction Problems (CSPs)

Constraint satisfaction problems n A CSP is composed of: q A set of variables X 1,X 2,…,X n with domains (possible values) D 1,D 2,…,D n q A set of constraints C 1,C 2, …,C m q Each constraint C i limits the values that a subset of variables can take, e.g., V 1 ≠ V 2 4

Tags:

  Satisfaction, Problem, Constraints, Pcss, Constraint satisfaction problems

Information

Domain:

Source:

Link to this page:

Please notify us if you found a problem with this document:

Other abuse

Related search queries