A restriction on the value of one variable. In a finite-domain constraint satisfaction problem, it can be applied by deleting disallowed values from that variable's constraint domain before search. It introduces no edge in the binary constraint graph.

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

View article source

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.
See all articles in the same topic Create my own version