documents/libman/obsman.tex

93 existing code to the newer libraries. Documentation for the new libraries
105     new {\bf ic_sets} library.
219 The system replaces such a subexpression by a new variable {\it X}
220 and adds a new constraint {\it VarA \#= VarB * X}.
222 are replaced by a new variable {\it X}
223 and a new constraint {\it X \#= VarA * VarB} is added,
261 according to the new domain; if it is instantiated, the predicate checks
343 found solution, failure is forced and a new solution is searched for.
344 When a new better solution is found, the bound is updated and
346 Each time a new better solution is found, the event 280 is raised.
354 When a new better solution is found, the search does not restart
356 Each time a new better solution is found, the event 280 is raised.
1020 and their domains, modify them and write new constraint
1157 the same physical domain and so when defining a new variable
1302 if the size of the new domain is smaller than the size of
1308 If the size of the new domain is equal to the old one, no
1311 If the size of the new domain is greater than the old one,
1318 If the size of the new domain is 1, {\it DVar}
1329 \item Each time a new domain variable is created, either
1353 We will demonstrate creation of new constraints on the
1420 the new maximum of the domain, and then update the domain
1424 and instantiates the variable if its new domain is a singleton.
1428 in the new domains.
1438 the new suspension, otherwise updates made in the
1564 This way of defining new constraints is often the most efficient
1583 We define a new variable {\bf I} which is a sort of index into the
1856 If this fails, a new bin represented by a list
1861 appropriate constraints are imposed on all the new bin's