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

Discussion

What is arc consistency?

  • A.Every pair of the variables is connected by at least one constraint
  • B.Every value of a variable has a supporting value in each neighbour
  • C.Every constraint in the problem is satisfied by the assignment
  • D.Every variable has at least one value left in its domain

Answer: B

An arc from X to Y is consistent when every remaining value of X has some value of Y consistent with it, and enforcing it across the whole problem deletes values no solution could use. Satisfaction concerns complete assignments, non-empty domains are weaker, and connectivity is a property of the graph. Defining a local property whose global enforcement prunes the search is the pattern every consistency notion follows.

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

Post your comment

Please log in or register to post a comment.