Theory of linear and integer programming
Theory of linear and integer programming
The CLP( R ) language and system
ACM Transactions on Programming Languages and Systems (TOPLAS)
A canonical form for generalized linear constraints
Journal of Symbolic Computation
Practical tools for reasoning about linear constraints
Fundamenta Informaticae - Special issue: logics for artificial intelligence
Global analysis of constraint logic programs
ACM Transactions on Programming Languages and Systems (TOPLAS)
From logic programming to Prolog
From logic programming to Prolog
Parameterized polyhedra and their vertices
International Journal of Parallel Programming
Abstracting numeric constraints with Boolean functions
Information Processing Letters
Higher-Precision Groundness Analysis
Proceedings of the 17th International Conference on Logic Programming
ACM Transactions on Programming Languages and Systems (TOPLAS)
| Hi-index | 0.00 |
We present a type system for linear constraints over reals and its use in mode analysis of CLP programs. The type system is designed to reason about the properties of definiteness, lower and upper bounds of variables of a linear constraint. Two proof procedures are presented for checking validity of type assertions. The first one considers lower and upper bound types, and it relies on solving homogeneous linear programming problems. The second procedure, which deals with definiteness as well, relies on computing the Minkowski's form of a parameterized polyhedron. The two procedures are sound and complete. We extend the approach to deal with strict inequalities and disequalities. Type assertions are at the basis of moding constraint logic programs. We extend the notion of well-moding from pure logic programming to CLP(${\cal R}$).