Transformations of CLP modules

S. Etalle, M. Gabbrielli

    Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

    76 Citaten (Scopus)


    We propose a transformation system for Constraint Logic Programming (CLP) aprograms and modules. The framework is inspired by the one of [37] for pure logic programs. However, the use of CLP allows us to introduce some new operations such as splitting and constraint replacement. We provide two sets of applicability conditions. The first one guarantees that the original and the transformed programs have the same computational behaviour, in terms of answer constraints. The second set contains more restrictive conditions that ensure compositionality: we prove that under these conditions the original and the transformed modules have the same answer constraints also when they are composed with other modules. This result is proved by first introducing a new formulation, in terms of trees, of a resultants semantics for CLP. As corollaries we obtain the correctness of both the modular and the nonmodular system w.r.t. the least model semantics.
    Originele taal-2Engels
    Pagina's (van-tot)101-146
    Aantal pagina's46
    TijdschriftTheoretical Computer Science
    Nummer van het tijdschrift1-2
    StatusGepubliceerd - 1996

    Vingerafdruk Duik in de onderzoeksthema's van 'Transformations of CLP modules'. Samen vormen ze een unieke vingerafdruk.

    Citeer dit