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 . 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.
|Number of pages||15|
|Publication status||Published - 1995|
|Event||12th International Conference on Logic Programming, ICLP 1995 - Tokyo, Japan|
Duration: 13 Jun 1995 → 16 Jun 1995
Conference number: 12
|Conference||12th International Conference on Logic Programming, ICLP 1995|
|Period||13/06/95 → 16/06/95|