http://www.cnr.it/ontology/cnr/individuo/prodotto/ID7420

A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs (Articolo in rivista)

Type

Label

A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs (Articolo in rivista) (literal)

Anno

Alternative label

Senni, V.; Pettorossi, A.; Proietti, M. (2008)
A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs
in Lecture notes in computer science
(literal)

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#autori

Pagina inizio

Pagina fine

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#numeroVolume

Rivista

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#note

24th International Conference on Logic Programming a cura di Garcia de la Banda, M. and Pontelli, E. (literal)

Note

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#affiliazioni

Titolo

A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs (literal)

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. (literal)

Prodotto di

Autore CNR

Autore CNR di

Prodotto

Http://www.cnr.it/ontology/cnr/pubblicazioni.owl#rivistaDi

data.CNR.it