documents/libman/extconjunto.tex

83 set variable and {\em w} is the weight or cost associated to this
228 {\bf sum\verb/_/weight(?S,?W)}
229 \index{sum\verb/_/weight/2}
232 {\em W} is the weight of {\em S}. If {\em W} is a free variable, this
233 predicate is a mean to access the set weight and attach it to W. If
234 not, the weight of S is constrained to be W. e.g.
300 \subsection{Subset-sum computation with convergent weight}
304 is a subset $s'$ of {\em S} whose weight is {\em t}. This also corresponds to
306 its  weight is {\em t}.
333 % The set weight has to be less than Sum
375 We state constraints which limit the weight of the set. We apply the
382 the set domain which has the biggest weight using
394 criteria mainly concern the cardinality or the weight of a set term.
397 weight. There is no need to define additional optimization predicates.
554 weight constraints combined with some disjointness constraints.
559 its possible weight. As the set variable is a metaterm i.e. an
569 {\bf set\{setdom:[Glb,Lub], card:C, weight:W, del\verb/_/inst:Dinst,
573 cardinality, and weight (null if undefined) and together with four
586 \item {\bf weight} The representation of the set weight. The weight is
646 {\bf el\verb/_/weight(++E, ?We)}
647 \index{el\verb/_/weight/2}
649 If {\em E} is element of a weighted domain, it returns the weight
652 {\bf max\verb/_/weight(?Svar,?E)}
653 \index{max\verb/_/weight/2}
657 bound and the lower bound and which has the greatest weight. If {\em
658 Svar} is a ground set, it returns the element with the biggest weight.