The set of values permitted for a variable in a constraint satisfaction problem. All assignments before relational constraints form the Cartesian product , whose cardinality is for finite domains. Unary restrictions can be incorporated directly into the constraint domain by deleting forbidden values.

Ancestors (7)

  1. Constraint satisfaction problem
  2. Search problem
  3. Computational problem
  4. Computational complexity theory
  5. Theoretical computer science
  6. Computer science
  7. Home

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.