Abstract
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}\)).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Apt, K.R.: From Logic Programming to Prolog. Prentice-Hall, Englewood Cliffs (1997)
Baker, N., Søndegaard, H.: Definiteness analysis for CLP(\({\cal R}\)). In: Gupta, G., et al. (eds.) Australian Computer Science Conference, pp. 321–332 (1993)
Chernikova, N.V.: An algorithm for finding the general formula for non-negative solutions of systems of linear inequalities. U.S.S.R. Computational Mathematics and Mathematical Physics 5, 228–233 (1965)
Codish, M., Genaim, S., Søndegaard, H., Stuckey, P.: Higher-precision groundness analysis. In: Codognet, P. (ed.) ICLP 2001. LNCS, vol. 2237, pp. 135–149. Springer, Heidelberg (2001)
de la Banda, M.G., Hermenegildo, M., Bruynooghe, M., Dumortier, V., Janssens, G., Simoens, W.: Global analysis of constraint logic programs. ACM Transactions on Programming Languages and Systems 18(5), 564–614 (1996)
Dolzmann, A., Sturm, T., Weispfenning, V.: Real quantifier elimination in practice. In: Matzat, B.H., Greuel, G.-M., Hiss, G. (eds.) Algorithmic Algebra and Number Theory, pp. 221–248. Springer, Berlin (1998)
Gal, T.: Postoptimal Analyses, Parametric Programming, and Related Topics, 2nd edn., de Gruyter, Berlin, Germany (1995)
Howe, J.M., King, A.: Abstracting numeric constraints with boolean functions. Information Processing Letters 75(1-2), 17–23 (2000)
Huynh, T., Joskowicz, L., Lassez, C., Lassez, J.-L.: Practical tools for reasoning about linear constraints. Fundamenta Informaticae 15(3-4), 357–380 (1991)
Jaffar, J., Maher, M.J.: Constraint logic programming: A survey. Journal of Logic Programming 19, 20, 503–581 (1994)
Jaffar, J., Michaylov, S., Stuckey, P., Yap, R.: The CLP(\({\cal R}\)) language and system. ACM Transactions on Programming Languages and Systems 14(3), 339–395 (1992)
Lassez, J.-L., McAllon, K.: A canonical form for generalized linear constraints. Journal of Symbolic Computation 13(1), 1–24 (1992)
Loechner, V.: Polylib: a library for manipulating parameterized polyhedra, Version 5.22.3 (2007), http://icps.u-strasbg.fr/polylib/
Loechner, V., Wilde, D.K.: Parameterized polyhedra and their vertices. International Journal of Parallel Programming 25, 525–549 (1997)
Murty, K.G.: Linear Programming. John Wiley & Sons, Chichester (1983)
Schrijver, A.: Theory of Linear and Integer Programming. J. Wiley & Sons, Chichester (1986)
Le Verge, H.: A note on Chernikova’s algorithm. Technical Report 635, IRISA, Campus Universitaire de Beaulieu, Rennes, France (1992)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ruggieri, S., Mesnard, F. (2008). Typing Linear Constraints for Moding CLP(\({\cal R}\)) Programs. In: Alpuente, M., Vidal, G. (eds) Static Analysis. SAS 2008. Lecture Notes in Computer Science, vol 5079. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69166-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-69166-2_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69163-1
Online ISBN: 978-3-540-69166-2
eBook Packages: Computer ScienceComputer Science (R0)