A Folding Rule for Eliminating Existential Variables from Constraint Logic Programs

Issue title: Advances in Computational Logic (CIL C08)

Article type: Research Article

Authors: Senni, Valerio | Pettorossi, Alberto | Proietti, Maurizio

Affiliations: Department of Informatics, Systems, and Production University of Rome Tor Vergata Via del Politecnico 1, 00133 Rome, Italy. E-mail: [email protected]; [email protected] | IASI-CNR Viale Manzoni 30, 00185 Rome, Italy. E-mail: [email protected]

Abstract: The existential variables of a clause in a constraint logic program are the variables which occur in the body of the clause and not in its head. The elimination of these variables is a transformation technique which is often used for improving program efficiency and verifying program properties. We consider a folding transformation rule which ensures the elimination of existential variables and we propose an algorithm for applying this rule in the case where the constraints are linear inequations over rational or real numbers. The algorithm combines techniques for matching terms modulo equational theories and techniques for solving systems of linear inequations. Through some examples we show that an implementation of our folding algorithm has a good performance in practice.

Keywords: Program transformation, folding rule, variable elimination, constraint logic programming

DOI: 10.3233/FI-2009-183

Journal: Fundamenta Informaticae, vol. 96, no. 3, pp. 373-393, 2009