The Solvers

suspend

This is the simplest possible 'solver'. Its behaviour is to wait until all variables in a constraint have been instantiated to numbers. Then it performs a test to check whether the constraint is satisfied, and fails if this is not the case.

fd

The finite-domain solver, see chapter 3. It only implements constraints over integers and arithmetic expressions of a limited form. As far as most of the simple arithmetic constraints are concerned, it maintains bound-consistency.

ic

A new hybrid solver, combining integer and real interval constraint solving. While currently restricted to only linear constraints, when completed this solver is intended to replace the FD and RIA solvers. For more information, please see chapter 5.

eplex

An interface to an LP or MIP solver, i.e. it implements linear constraints over reals or integers.

fdplex

An example of a hybrid solver that combines the fd and eplex solvers.

arith

This is not really a solver, but just the implementation of simple arithmetic tests in module eclipse_language. These require that all variables are instantiated when the test is invoked. The reason to list it here is that the proper solvers use the same syntax and can be considered generalisations of the traditional tests.