documents/libman/extfd.tex

114 The system replaces such a subexpression by a new variable {\it X}
115 and adds a new constraint {\it VarA \#= VarB * X}.
117 are replaced by a new variable {\it X}
118 and a new constraint {\it X \#= VarA * VarB} is added,
156 according to the new domain; if it is instantiated, the predicate checks
238 found solution, failure is forced and a new solution is searched for.
239 When a new better solution is found, the bound is updated and
241 Each time a new better solution is found, the event 280 is raised.
249 When a new better solution is found, the search does not restart
251 Each time a new better solution is found, the event 280 is raised.
914 and their domains, modify them and write new constraint
1051 the same physical domain and so when defining a new variable
1196 if the size of the new domain is smaller than the size of
1202 If the size of the new domain is equal to the old one, no
1205 If the size of the new domain is greater than the old one,
1212 If the size of the new domain is 1, {\it DVar}
1223 \item Each time a new domain variable is created, either
1247 We will demonstrate creation of new constraints on the
1314 the new maximum of the domain, and then update the domain
1318 and instantiates the variable if its new domain is a singleton.
1322 in the new domains.
1332 the new suspension, otherwise updates made in the
1458 This way of defining new constraints is often the most efficient
1477 We define a new variable {\bf I} which is a sort of index into the
1750 If this fails, a new bin represented by a list
1755 appropriate constraints are imposed on all the new bin's