Skip Navigation

Journal of Logic and Computation 1995 5(2):133-171; doi:10.1093/logcom/5.2.133
© 1995 by Oxford University Press
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by GABBRIELLI, M.
Right arrow Articles by LEVI, G.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Original Articles

Observable Semantics for Constraint Logic Programs

MAURIZIO GABBRIELLI, GIOVANNA M. DORE and GIORGIO LEVI

Dipartimento di Informatica, Università di Pisa Corso Italia 40, 56125 Pisa, Italy E-mail: gabbri{at}di.unipi.it
DS Logics Viale Silvani 1, 40122 Bologna, Italy E-mail: dore{at}bologics.dslogics.ddslogics.it
Dipartimento di Informatica, Università di Pisa Corso Italia 40, 56125 Pisa, Italy E-mail: levi{at}di.unipi.it

We consider the constraint logic programming paradigm CLP({chi}), as defined by Jaffar and Lassez. CLP({chi}) integrates a generic computational mechanism based on constraints within the logic programming framework. The paradigm retains the semantic properties of pure logic programs, namely the existence of equivalent operational, model-theoretic and fixpoint semantics. We introduce a framework for defining various semantics, each corresponding to a specific observable property of CLP computations. Each semantics can be defined either operationally (i.e. top-down) or declaratively (i.e. bottom-up). The construction is based on a new notion of interpretation, on a natural extension of the standard notion of model and on the definition of various immediate consequences operators, whose least fixpoints on the lattice of interpretations are models corresponding to various observable properties. We first consider some semantics defined by Jaffar and Lassez and their relations, in terms of correctness and full abstraction, to the equivalences induced on programs by suitable observables. Then we define a fully abstract semantics which models answer constraints. Finally we introduce a semantics for answer constraints which is compositional w.r.t. union of programs. Suitable abstractions of this semantics allow us to obtain correct (in one case fully abstract) semantics for partial answers and call patterns. Our semantic constructions can be taken as the basis for program transformation and (modular) analyses techniques.

Keywords: Constraints,; logic programming,; semantics.


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.