Senni, Valerio and Pettorossi, Alberto and Proietti, Maurizio A Folding Rule for Eliminating Existential Variables from Constraint Logic Programs. Fundamenta Informaticae, 96 (3). pp. 373-393. ISSN 1875-8681 (2009)Full text not available from this repository.
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.
|Uncontrolled Keywords:||Program transformation; folding rule; variable elimination; constraint logic programming|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Research Area:||Computer Science and Applications|
|Depositing User:||Users 40 not found.|
|Date Deposited:||24 Sep 2012 12:48|
|Last Modified:||07 Mar 2013 12:56|
Actions (login required)