This manual documents the major ECLiPSe libraries.
They are enabling tools for the development and delivery
of planning and scheduling applications.
Since this is an area of active research and new developments,
these libaries are subject to technical improvements, addition
of new features and redesign as part of our ongoing work.
In this section we shall briefly summarize the constraint solvers that
are available as ECLiPSe libraries.
No examples are given here - each solver has its own documentation
with examples for the interested reader.
Note that the global flag coroutine has a similar effect:
it causes the arithmetic comparisons as well as many other
built-in predicates to delay until they are sufficiently instantiated
- There is also an older implementation, the fd library,
whose use is deprecated
There is also an older implementation, the conjunto library, which
is generally less efficient, but implements sets of symbolic elements as
well as integer sets
The ic library replaces the old ria interval solver, and
covers most of the functionality of the finite domain solver fd