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

Discussion

What is a global constraint?

  • A.One that applies to every variable in the problem
  • B.One that cannot be expressed as a set of binary constraints
  • C.One imposed by the environment rather than the problem
  • D.One relating an arbitrary number of variables

Answer: D

A global constraint such as all different relates any number of variables and has a specialised propagation algorithm far stronger than decomposing it into pairwise inequalities. It need not involve every variable, and it can in principle be decomposed, though at a heavy loss of propagation strength. Providing an efficient algorithm for a commonly occurring pattern, rather than expressing it in primitives, is what makes constraint programming systems practical.

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

Post your comment

Please log in or register to post a comment.