
<ConsistencyModule:> +ConX => +ConY

   Constraint ConX  implies ConY.

Arguments
   ConX                Constraint
   ConY                Constraint

Type
   library(gfd)

Description

   Equivalent to BX #= (ConX), BY #= (ConY), BX #=< BY
   
   The two constraints are reified in such a way that ConX being true
   implies that ConY must also be true.  ConX and ConY must be 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.



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

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