Skip to main navigation Skip to search Skip to main content

Complementing logic program semantics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

We consider abstract interpretation, and in particular the basic operators of reduced product and complementation of abstract domains, as a tool to systematically derive denotational semantics by composition and decomposition. Reduced product allows to perform the logical conjunction of semantics, while complementation characterizes what is left from a semantics when the information concerning a given observable property is "subtracted" from it. We apply this idea to the case of logic programming, characterizing in a uniform algebraic setting, the interaction between a number of well known declarative semantics for logic programs.

Original languageEnglish (US)
Title of host publicationAlgebraic and Logic Programming - 5th International Conference, ALP 1996, Proceedings
EditorsMichael Hanus, Mario Rodriguez-Artalejo
PublisherSpringer-Verlag
Pages238-253
Number of pages16
ISBN (Print)3540617353, 9783540617358
DOIs
StatePublished - 1996
Externally publishedYes
Event5th International Conference on Algebraic and Logic Programming, ALP 1996 - Aachen, Germany
Duration: Sep 25 1996 → Sep 27 1996

Publication series

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

Conference

Conference5th International Conference on Algebraic and Logic Programming, ALP 1996
Country/TerritoryGermany
CityAachen
Period9/25/96 → 9/27/96

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Complementing logic program semantics'. Together they form a unique fingerprint.

Cite this