The Expressive Powers of the Logic Programming Semantics

We study the expressive of two semantics far deductive databases and logic programming: the well-founded semantics and the stable semantics. We compare them especially to two older semantics, the two-valued and three-valued program completion semantics. We identify the expressive power of the stable...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of computer and system sciences Jg. 51; H. 1; S. 64 - 86
1. Verfasser: Schlipf, J.S.
Format: Journal Article Tagungsbericht
Sprache:Englisch
Veröffentlicht: Brugge Elsevier Inc 01.08.1995
Academic Press
Schlagworte:
Applied sciences
Computer science; control theory; systems
Exact sciences and technology
Information systems. Data bases
Memory organisation. Data processing
Programming languages
Programming theory
Software
Theoretical computing
Logical programming
Deductive database
Stratification
Semantics
Modularity
ISSN:0022-0000, 1090-2724
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We study the expressive of two semantics far deductive databases and logic programming: the well-founded semantics and the stable semantics. We compare them especially to two older semantics, the two-valued and three-valued program completion semantics. We identify the expressive power of the stable semantics and, in fairly general circumstances, that of the well-founded semantics. In particular, over infinite Herbrand universes, the four semantics all have the same expressive power. We discuss a feature of certain logic programming semantics, which we call the Principle of Stratification, a feature allowing a program to be built easily in modules. The three-valued program completion and well-founded semantics satisfy this principle. Over infinite Herbrand models, we consider a notion of translatability between the three-valued program completion and well-founded semantics which is in a sense uniform in the strata. In this sense of uniform translatability we show the well-founded semantics to be more expressive than the three-valued program completion. The proof is a corollary of our result that over non-Herbrand infinite models, the well-founded semantics is more expressive than the three-valued program completion semantics.
ISSN:0022-0000
1090-2724
DOI:10.1006/jcss.1995.1053