[ library(ic) | Reference Manual | Alphabetic Index ]
+ConX or +ConY
At least one of the constraints ConX or ConY must be true.
Equivalent to BX $= (ConX), BY $= (ConY), BX + BY #>= 1
The two constraints are reified in such a way that at least one must be
true. ConX and ConY must be constraints that have a corresponding
or / 3, neg / 1, neg / 2, and / 2, and / 3, => / 2, => / 3, =:= / 3, =< / 3, =\= / 3, >= / 3, > / 3, < / 3