![]()
mathend000#
X2 - Y2 = Z2 X + Y + Z < U X + Y5 . Z
mathend000#
X1,..., X9mathend000# are pairwise distinct
A domain constraint (also called basic constraint) takes the form
x
A finite domain problem is a finite set P of quantifier-free
constraints such that P
contains a domain constraint for every variable occurring in a
constraint of P. A variable
assignment is a function mapping variables to integers.
A solution of a finite domain problem P is a variable
assignment that satisfies every
constraint in P.
Notice that a finite domain problem has at most finitely
many solutions, provided we consider
only variables that occur in the problem (since the problem
contains a finite domain constraint
for every variable occurring in it).
D