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

Discussion

What technique from satisfiability solving transferred to constraint solving?

  • A.The use of binary rather than n-ary constraints
  • B.Random restarts of the search from the beginning
  • C.The representation of the variables as boolean values
  • D.Conflict driven clause learning as no-good learning

Answer: D

Learning a constraint from each failure, so the same doomed combination is never reconstructed, transformed satisfiability solving and was carried across as no-good learning. Restarts also transferred and are genuinely useful, though the learning is the larger contribution. Constraint arity and boolean encoding run the other way. Techniques crossing between neighbouring fields, once the correspondence is noticed, is a recurring source of progress.

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

Post your comment

Please log in or register to post a comment.