[ library(ic) | Reference Manual | Alphabetic Index ]
Bool is the reified truth of constraint ConX implying the truth of ConY.
- Reified truth value of the constraint
Equivalent to BX $= (ConX), BY $= (ConY), Bool #= (BX #=< BY)
The two constraints are reified in such a way that Bool is true if ConX
being true implies that ConY must also be true. ConX and ConY must be
constraints that have a corresponding reified form.
=> / 2, neg / 1, neg / 2, or / 2, or / 3, and / 2, and / 3, =:= / 3, =< / 3, =\= / 3, >= / 3, > / 3, < / 3