A Transformation System for Modular CLP Programs

Sandro Etalle, Leon S. Sterling (Editor), Maurizio Gabbrielli

    Research output: Contribution to conferencePaperpeer-review

    68 Downloads (Pure)


    We propose a transformation system for CLP programs and modules. The framework is inspired by the one of Tamaki and Sato for pure logic programs [19]. Here, 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 behavior, 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. As corollaries we obtain the correctness of both the modular and the non-modular system w.r.t. the least model semantics.
    Original languageUndefined
    Number of pages15
    Publication statusPublished - 1995
    Event12th International Conference on Logic Programming, ICLP 1995 - Tokyo, Japan
    Duration: 13 Jun 199516 Jun 1995
    Conference number: 12


    Conference12th International Conference on Logic Programming, ICLP 1995
    Abbreviated titleICLP


    • IR-56273
    • EWI-1151

    Cite this