Abstract: Linear constraint solving in constraint logic programming requires incremental checks of the satisfiability of a system of equations and inequalities. Experience has shown that Gauss-Jordan ...

We give an algorithm which computes a normal form of Boolean constraint systems made up of equalities ... CLP languages as instances of our model which do not make use of pseudo-equations (Prolog III, ...