Lines Matching refs:S1
167 {\bf ?S \verb/`=/ ?S1}
170 the value of the set term {\em S1}.
191 {\bf ?S \verb/`</ ?S1}
195 term {\bf S1}. If the two terms are ground sets it just checks the
197 S} is not included in the upper bound of {\em S1} domain, it fails.
201 {\bf ?S \verb/`<>/ ?S1}
204 The domains of S and S1 are disjoint (intersection empty).
324 solve(S1, Sum) :-
326 S1 `:: {}.. S,
327 trim(S, S1),
328 constrain_weight(S1, Sum),
329 sum_weight(S1, W),
331 min_max(labeling(S1), Cost).
334 constrain_weight(S1, Sum) :-
335 sum_weight(S1, W),
339 trim(S, S1) :-
341 trim1(LS, S1).
343 trim1(LS, S1) :-
346 testsubsumed(D, E, LSorted, S1).
349 testsubsumed(D, E, [F | LS], S1) :-
353 testsubsumed(D, F, LS, S1)
355 F notin S1,
356 testsubsumed(D, E, LS, S1)
439 all_distincts([S1 |L], L2) :-
440 distinctsfrom(S1, L2),
443 distinctsfrom(S, S1) :-
444 #(S /\ S1,C),
728 structure. We define the predicate \verb/incl(S,S1)/ which corresponds
733 incl(S,S1) :-
734 set(S),set(S1),
736 check_incl(S, S1).
737 incl(S, S1) :-
739 set_range(S1, Glb1, Lub1),
743 modify_bound(glb, S1, S1NewGlb).
744 incl(S, S1) :-
745 set(S1),
748 check_incl(Glb, S1),
749 large_inter(S1, Lub, SNewLub),
751 incl(S,S1) :-
753 set_range(S1, Glb1, Lub1),
757 modify_bound(glb, S1, S1NewGlb),
759 ( (set(S) ; set(S1)) ->
762 make_suspension(incl(S, S1),2, Susp),
763 insert_suspension([S,S1], Susp, del_any of set, set)