Pages

Friday, February 27, 2009

Typing Linear Constraints for Moding CLP(R) Programs

Typing Linear Constraints for Moding CLP(R) Programs

Abstract

We present a type system for linear constraints over reals. 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.

No comments:

Post a Comment