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