Lines Matching defs:be
33 In general, real values cannot be represented exactly if the representation
52 Of course, interval arithmetic is no panacea: it may be that the final
53 interval is too wide to be useful. However this indicates that the problem
57 have been no indication that there might be a problem.
68 \item Other numeric types can be converted to bounded reals by giving them
106 \section{Issues to be aware of when using bounded reals}
115 An example of this can be seen in Figure~\ref{interval-compare}. If the
139 If the comparison cannot be determined definitively, the comparison succeeds
170 floating point numbers 0.0 and -0.0 are considered to be syntactically
176 goals) --- though one does need to be careful when comparing or sorting
227 When writing code such as the above, if \texttt{X} could be a bounded real,
230 delayed goal \texttt{-0.1__0.1 >= 0} will be left behind and Code A
245 Finally, if one wishes Code B to be executed instead of Code A in the case
276 \item Real variables may be declared using
301 \item Solutions to real constraints can be found using
324 In very simple cases, just imposing the constraints may be sufficient to
344 In general though, some extra work will be needed to find the solutions of a
346 Which method is appropriate depends on the nature of the solutions to be
349 \bipref{locate/3}{../bips/lib/ic/locate-3.html} would be good choices. If
351 \bipref{squash/3}{../bips/lib/ic/squash-3.html} may be more appropriate.
487 A solution to the problem can then be found by first instantiating the area
490 the farm first ensures that the first solution returned will be the minimal
508 may be found in \texttt{farm.ecl}, if you have access to it.) Try running
514 Would this be a good candidate for the global constraint