Lines Matching refs:new
33 in this chapter is being phased out and replaced by the new set solver
157 variable its domain will be updated according to the new domain; if
535 Set constraints propose a new modelling of already solved problems or
536 allows (like for the {\em subset-sum} example) to solve new problems
561 process the set variables and their domains, modify them and write new
701 have {\em Newbound} equal to S. If {\em S} is a set variable, its new
703 domains can only get reduced. So a new upper bound has to be contained
704 in the old one and a new lower bound has to contain the old one.
708 \section{Example of defining a new constraint}
710 The following example demonstrates how to create a new set constraint. To
818 we compute the new lower bound ({\em i.e.}, adding elements from the
826 bound of the set variable might not be consistent any more. The new
834 we compute the new one by making the union with first sec lower bound.
836 consistent any more. If so, we compute the new one by intersecting (in
837 the lattice acceptation) the both upper bounds to compute the new
852 after inserting the new suspension, otherwise the new updates coming