Transformations of CLP Modules

Sandro Etalle, Maurizio Gabbrielli

Research output: Contribution to journalArticleAcademicpeer-review

73 Citations (Scopus)
37 Downloads (Pure)

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.
Original languageUndefined
Pages (from-to)101-146
Number of pages46
JournalTheoretical computer science
Volume166
Issue number1
DOIs
Publication statusPublished - 1996

Keywords

  • EWI-1105
  • IR-55940

Cite this

Etalle, Sandro ; Gabbrielli, Maurizio. / Transformations of CLP Modules. In: Theoretical computer science. 1996 ; Vol. 166, No. 1. pp. 101-146.
@article{0c082c7d0561466398aa4fb6ed9f7b9e,
title = "Transformations of CLP Modules",
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.",
keywords = "EWI-1105, IR-55940",
author = "Sandro Etalle and Maurizio Gabbrielli",
note = "Imported from DIES",
year = "1996",
doi = "10.1016/0304-3975(95)00148-4",
language = "Undefined",
volume = "166",
pages = "101--146",
journal = "Theoretical computer science",
issn = "0304-3975",
publisher = "Elsevier",
number = "1",

}

Transformations of CLP Modules. / Etalle, Sandro; Gabbrielli, Maurizio.

In: Theoretical computer science, Vol. 166, No. 1, 1996, p. 101-146.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - Transformations of CLP Modules

AU - Etalle, Sandro

AU - Gabbrielli, Maurizio

N1 - Imported from DIES

PY - 1996

Y1 - 1996

N2 - 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.

AB - 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.

KW - EWI-1105

KW - IR-55940

U2 - 10.1016/0304-3975(95)00148-4

DO - 10.1016/0304-3975(95)00148-4

M3 - Article

VL - 166

SP - 101

EP - 146

JO - Theoretical computer science

JF - Theoretical computer science

SN - 0304-3975

IS - 1

ER -