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 ...

In this paper, we propose a generalization of the processing of Boolean constraints in CLP by introducing a new type of constraint, the pseudo-equality, which can be used to partially disconnect ...