Transformations of CLP modules

Share/Save/Bookmark

Etalle, Sandro and Gabbrielli, Maurizio (1996) Transformations of CLP modules. Theoretical Computer Science, 166 (1). pp. 101-146. ISSN 0304-3975

[img]
Preview
PDF
2451Kb
Abstract: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.
Item Type:Article
Copyright:© 1996 Elsevier B.V.
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Link to this item:http://purl.utwente.nl/publications/55940
Official URL:http://dx.doi.org/10.1016/0304-3975(95)00148-4
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page