Lines Matching refs:sets
44 that contain herbrand terms as well as ground sets. Modules that use
75 of elements of D. Thus they are both ground sets. S is then called a
95 \begin{quote} A composition of set domain variables or ground sets together
116 sets : $Glb_s .. Lub_s $
195 term {\bf S1}. If the two terms are ground sets it just checks the
209 {\em Lsets} is a list of set variables or ground sets. {\em S} is a
210 set term which is the union of all these sets. If {\em S} is a free
212 from the union of the domains or ground sets in {\em Lsets}.
217 {\em Lsets} is a list of set variables of ground sets. All the sets are pairwise
286 first two sets. The first execution tells us that
435 % the labeled sets are distinct from the set to be labeled
471 The approach with sets is the following: first we create the number of
479 sets are labeled one after the other. Each time one set is labeled,
481 labeled. This constraint states that two sets have at most one element
727 iterations do not suit sets and benefit much more from a list
842 implies an instanciation of one of the two sets. If this is not the
858 variable as well as a ground set respectively as an interval of sets or