Solvers
Underneath any constraint-based system is a constraint solver that takes equations and solves them (preferably quickly)
The constraint satisfaction algorithms used depend on the domain over which the constraints are defined
- For reals, common algorithms include gauss and simplex methods
- A little more later
To become truly facile at CLP for a given domain one has to become knowledgeable about the solvers