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

Discussion

What is a solution to a constraint problem?

  • A.A complete assignment satisfying every constraint
  • B.A partial assignment that violates no constraint so far
  • C.The sequence of assignments made during the search
  • D.The set of values remaining after propagation

Answer: A

A solution gives every variable a value and violates nothing, whereas a consistent partial assignment is merely a node in the search that may or may not extend. The order of assignment is not part of the answer, and propagated domains are an intermediate state. Being precise about what constitutes an answer determines when the algorithm may stop, which is not always obvious in problems where partial progress looks like success.

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

Post your comment

Please log in or register to post a comment.