Logo eprints

Folding Transformation Rules for Constraint Logic Programs

Senni, Valerio and Pettorossi, Alberto and Proietti, Maurizio Folding Transformation Rules for Constraint Logic Programs. In: CILC08, 23-esimo Convegno Italiano di Logica Computazionale , 10-12 Luglio 2008, Università di Perugia, Italy pp. 1-22. (Submitted) (2008)

PDF - Accepted Version
Download (259kB) | Preview
Related URLs


We consider the folding transformation rule for constraint logic programs. We propose an algorithm for applying the folding rule in the case where the constraints are linear equations and inequations over the rational or the real numbers. Basically, our algorithm consists in reducing a rule application to the solution of one or more systems of linear equations and inequations. We also introduce two variants of the folding transformation rule. The first variant combines the folding rule with the clause splitting rule, and the second variant eliminates the existential variables of a clause, that is, those variables which occur in the body of the clause and not in its head. Finally, we present the algorithms for applying these variants of the folding rule.

Item Type: Conference or Workshop Item (Paper)
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Research Area: Computer Science and Applications
Depositing User: Users 40 not found.
Date Deposited: 25 Sep 2012 11:25
Last Modified: 07 Mar 2013 12:56
URI: http://eprints.imtlucca.it/id/eprint/1376

Actions (login required)

Edit Item Edit Item