A logical denotational semantics for constraint logic programming

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The process interpretation of constraint logic programming (clp) leads to a model which is similar for many aspects to (an unsynchronized version of) concurrent constraint programming (ccp). However, it differs from the latter because it supports the notion of consistency: an action can be performed only if it does not lead to an inconsistent store. We develop a denotational, fully abstract semantics for clp with respect to successful, failed and infinite observables. This semantics extends the standard model of clp in two ways: on one hand by capturing infinite computations; on the other hand by characterizing a more general notion of negation. Finally, our work can be regarded as a first step towards the development of a simple model for ccp with atomic tell.

Original languageEnglish
Title of host publicationProgramming Languages and Systems - ESOP '94 - 5th European Symposium on Programming, Proceedings
EditorsDonald Sannella
PublisherSpringer Verlag
Pages195-210
Number of pages16
ISBN (Print)9783540578802
DOIs
Publication statusPublished - 1 Jan 1994
Externally publishedYes
Event5th European Symposium on Programming, ESOP 1994 - Edinburg, United Kingdom
Duration: 11 Apr 199413 Apr 1994

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume788 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference5th European Symposium on Programming, ESOP 1994
Country/TerritoryUnited Kingdom
CityEdinburg
Period11/04/9413/04/94

Fingerprint

Dive into the research topics of 'A logical denotational semantics for constraint logic programming'. Together they form a unique fingerprint.

Cite this