Generated on Mon Aug 25 11:35:47 2008 for Gecode by doxygen 1.5.6

# Linear constraints over Boolean variables [Using finite domain integers]

All variants for linear constraints over Boolean variables share the following properties:
• Bounds consistency (over the real numbers) is supported for all constraints (actually, for disequlities always domain consistency is used as it is cheaper).
• Variables occurring multiply in the argument arrays are replaced by a single occurrence: for example, becomes .
• If in the above simplification the value for (or for and ) exceeds the limits for integers as defined in Int::Limits, an exception of type Int::OutOfLimits is thrown.
• Assume the constraint . If exceeds the limits for integers as defined in Int::Limits, an exception of type Int::OutOfLimits is thrown.
• In all other cases, the created propagators are accurate (that is, they will not silently overflow during propagation).