Control flow versus logic: A denotational and a declarative model for Guarded Horn Clauses

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

Abstract

The paper gives four semantic models for Guarded Horn Clauses (GHC). Two operational models are based on a transition system; the first one gives the set of computed answer substitutions (the so-called success set) and the second one takes deadlock and infinite behaviour into account. They are easily related. The main purpose of the paper is to develop compositional models for GHC that are correct with respect to the operational models. For the success set case we give a compositional declarative semantics which can be seen a an extension of models for Horn Clause Logic. Further, a metric semantics that uses tree-like structures is given, which is proved to be correct with respect to the second operational semantics.

Original languageEnglish
Title of host publicationMathematical Foundations of Computer Science 1989, Proceedings
EditorsAntoni Kreczmar, Grazyna Mirkowska
PublisherSpringer Verlag
Pages165-176
Number of pages12
ISBN (Print)9783540514862
DOIs
Publication statusPublished - 1 Jan 1989
Externally publishedYes
Event14th Symposium on Mathematical Foundations of Computer Science, MFCS 1989 - Porabka-Kozubnik, Poland
Duration: 28 Aug 19891 Sept 1989

Publication series

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

Conference

Conference14th Symposium on Mathematical Foundations of Computer Science, MFCS 1989
Country/TerritoryPoland
CityPorabka-Kozubnik
Period28/08/891/09/89

Fingerprint

Dive into the research topics of 'Control flow versus logic: A denotational and a declarative model for Guarded Horn Clauses'. Together they form a unique fingerprint.

Cite this