### Introduction

The clp(Q,R) system described in this document is an instance of the
general Constraint Logic Programming scheme introduced by
[Jaffar & Michaylov 87].

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.

The full clp(Q,R) distribution, including a stand-alone manual
and an examples directory that is possibly more up to date than
the version in the SICStus Prolog distribution, is available from
http://www.ai.univie.ac.at/clpqr/.