X/0¶

Y is iso

X* #==> B is det Reified implication

X* #<==> B is det reified equivalence

X* #>= is det elements of X must be increasinga or equal

X* #=< is det elements of X must be decreasing

X* #> is det elements of X must be increasing

X* #< is det elements of X must be decreasing or equal

X* #= Y is semidet disequality

X* #= is det all elements of X must take the same value

X* #>= Y is semidet larger or equal

X* #=< Y is semidet smaller or equal.

X* #> Y is semidet larger

X* #< Y is semidet smaller or equal

X* #= Y is semidet equality

Tries to unify terms X and Y.

Succeeds if terms X and Y are not unifiable.

Arguments to this constraint may be an arithmetic expression with +, -, \*, integer division /, min, max, sum, count, and abs. Boolean variables support conjunction (/), disjunction (\/), implication (=>), equivalence (<=>), and xor. The sum constraint allows a two argument version using the where conditional, in Zinc style.