Machine-translated by Google. Questions are authored in English.
Top

Discussion

What is the domain of a variable in a constraint problem?

  • A.The set of variables it is constrained with
  • B.The region of the constraint graph containing it
  • C.The set of values it may take
  • D.The set of constraints in which it appears

Answer: C

The domain lists the permitted values, and propagation works by deleting values from domains until either a solution is evident or a domain empties. Constraint membership and neighbourhood are properties of the graph, and graph regions are a structural notion. Keeping the three vocabularies apart, values, constraints and structure, is what allows a description of an algorithm to be read without ambiguity.

No comment is present. Be the first to comment.
Loading…

Post your comment

Please log in or register to post a comment.