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

Discussion

How is the general consistency hierarchy defined?

  • A.Every constraint involves at most k variables in the problem
  • B.The problem can be solved by assigning k variables at a time
  • C.Every variable has at least k values remaining in its domain
  • D.Any consistent assignment to k minus one variables extends to a kth

Answer: D

The general condition says that any consistent partial assignment of size k minus one can be extended to any further variable, with node, arc and path consistency being the cases of one, two and three. Strong n consistency for n variables permits a backtrack free solution but costs exponential effort to establish. Constraint arity, block assignment and domain size are different quantities. A parameterised family in which the extremes are trivial and intractable leaves the useful cases in the middle.

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

Post your comment

Please log in or register to post a comment.