Boolean constraints

Boolean variables are represented as domain variables whose domains are 0..1.

• and(?X,?Y,?Z) Succeeds if $X \wedge Y = Z$.

• and0(?X,?Y) Succeeds if $X \wedge Y = 0$.

• or(?X,?Y,?Z) Succeeds if $X \vee Y = Z$.

• or1(?X,?Y) Succeeds if $X \vee Y = 1$.

• not(?X,?Y) Succeeds if $\neg X = Y$.

• equiv(?X,?Y,?Z) Succeeds if $X \equiv Y = Z$.

• xor(?X,?Y,?Z) Succeeds if $X \otimes Y = Z$.

• at_least_one(+L) Succeeds if at least one element in L is equal to 1, where L is a list of boolean variables or integers.

• at_most_one(+L) Succeeds if at most one element in L is equal to 1, where L is a list of boolean variables or integers.

• only_one(+L) Succeeds if exactly one element in L is equal to 1, where L is a list of boolean variables or integers.