#### 10.11.1 Introduction

The clp(Q,R) system described in this chapter is an instance of the
general Constraint Logic Programming scheme introduced by [Jaffar &
Michaylov 87]. It is a third-party product, bundled with SICStus
Prolog as two library packages. It is not supported by SICS in any
way.

The implementation is at least as complete as other existing clp(R)
implementations: It solves linear equations over rational or real valued
variables, covers the lazy treatment of nonlinear equations,
features a decision algorithm for linear inequalities that detects
implied equations, removes redundancies, performs projections
(quantifier elimination), allows for linear dis-equations, and provides
for linear optimization.

Send feedback on this subject.