Ask & Tell Linear Constraints in
Constraint Logic Programming

Abstract
This article adresses the problem of linear constraint entailment in constraint logic programming. After a brief overview of linear constraint solving, two forms for ask constraints are introduced that simplifies the entailment test. The incremental algorithms are also described and has been integrated to a CLP language. Practical experiments with operation research problems show that substantial reductions of the search tree and of the computation time are obtained.