[ library(gfd) | Reference Manual | Alphabetic Index ]

<ConsistencyModule:> +ConX and +ConY

Constraints ConX and ConY must both be true.


Equivalent to BX #= (ConX), BY #= (ConY), BX + BY #= 2

The two constraints are reified in such a way that both must be true. ConX and ConY must be a constraints that have a corresponding reified form.

ConsistencyModule is the optional module specification to give the consistency level for the propagation for this constraint: gfd_bc for bounds consistency, and gfd_gac for domain (generalised arc) consistency.

This constraint is implemented using Gecode's MiniModel's rel() for both integer and boolean expressions, with sub-expressions/constraints not supported by MiniModel factored out and posted as auxiliary constraints.


This predicate is sensitive to its module context (tool predicate, see @/2).

See Also

and / 3, neg / 1, neg / 2, or / 2, xor / 2, => / 2, <=> / 2, suspend : and / 2, ic : and / 2