Abstract: "S-interpretations together with the notion of s-truth are used in [FLMP] to define a least model semantics that resembles very much the least Herbrand model semantics and that provides a strongly complete declarative modelling for positive logic programming (ie Horn clause logic + SL...

Ausführliche Beschreibung

Bibliographische Detailangaben

1. Verfasser:	Turi, Daniele (VerfasserIn)
Format:	Buch
Sprache:	English
Veröffentlicht:	Amsterdam 1989
Schriftenreihe:	Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 89,48
Schlagworte:	Logic programming
Zusammenfassung:	Abstract: "S-interpretations together with the notion of s-truth are used in [FLMP] to define a least model semantics that resembles very much the least Herbrand model semantics and that provides a strongly complete declarative modelling for positive logic programming (ie Horn clause logic + SLD-reduction). Defining cs-interpretations as sets of constrained atoms we extend s-interpretations to general programs (ie logic programs with negation). Chan's constructive negation has inspired our definition and provides a procedural support for the declarative framework we set up. In this,to define the notion of cs-truth, we introduce most general disunifiers between conjunctions of atoms and cs-interpretations Stratified programs are general programs much related to positive ones. In [ABW] a fixpoint construction is introduced to produce a minimal Herbrand model which extends to stratified programs the least Herbrand model for positive programs. In [P1] an alternative characterization of such model is given (perfect Herbrand model). Applying these two constructs to cs-models we obtain the unique perfect cs-model. We end the paper conjecturing a strong completeness for our cs-semantics wrt Przmusinski's interpreter for stratified programs and constructive negation (SLSC-resolution).
Beschreibung:	14 S.