Lines Matching refs:cardinality
223 {\em S} is a set term and {\em C} its cardinality. C can be a free
225 predicate is a mean to access the set cardinality and attach it to C.
226 If not, the cardinality of S is constrained to be C.
270 If now we add one cardinality constraint:
292 In the second example an additional constraint restricts the cardinality of
394 criteria mainly concern the cardinality or the weight of a set term.
396 {\bf fd} optimization predicates upon the set cardinality or the set
464 % constrains the cardinality of each set variable to be equal to V (=3)
477 all the domain variables are created, we constrain their cardinality
514 upper bound cardinality and thus the number of backtracks could be
558 access the properties of a set term like its domain, its cardinality,
573 cardinality, and weight (null if undefined) and together with four
581 \item {\bf card} The representation of the set cardinality. The
582 cardinality is initialized as soon as a set domain is attached to