eprintid: 1375
rev_number: 7
eprint_status: archive
userid: 40
dir: disk0/00/00/13/75
datestamp: 2012-09-24 13:49:23
lastmod: 2013-03-07 12:56:25
status_changed: 2012-09-24 13:49:23
type: book_section
metadata_visibility: show
creators_name: Senni, Valerio
creators_name: Pettorossi, Alberto
creators_name: Proietti, Maurizio
creators_id: valerio.senni@imtlucca.it
creators_id: 
creators_id: 
title: A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs
ispublished: pub
subjects: QA75
divisions: CSA
full_text_status: none
note: 24th International Conference, ICLP 2008 Udine, Italy, December 9-13 2008 Proceedings
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. We show that an implementation of our folding algorithm performs well in practice.
date: 2008
date_type: published
series: Lecture Notes in Computer Science
number: 5366
publisher: Springer
pagerange: 284-300
id_number: 10.1007/978-3-540-89982-2_29
refereed: TRUE
isbn: 978-3-540-89981-5
book_title: Logic Programming
official_url: http://dx.doi.org/10.1007/978-3-540-89982-2_29
citation:   Senni, Valerio and Pettorossi, Alberto and Proietti, Maurizio  A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs.   In:  Logic Programming.   Lecture Notes in Computer Science  (5366).  Springer, pp. 284-300.  ISBN 978-3-540-89981-5      (2008)