˜Theœ differential fixpoint operator with subsumption

Abstract: "Declarative languages for deductive and object- oriented databases require some high-level mechanism for specifying semantic control knowledge. This paper proposes user-supplied subsumption information as a paradigm to specify desired, prefered [sic], or useful deductions at the meta...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Körperschaft: Technische Universität München Institut für Informatik (BerichterstatterIn)
Weitere Verfasser: Köstler, Gerhard (BerichterstatterIn)
Format: UnknownFormat
Sprache:eng
Veröffentlicht: München 1993
Schriftenreihe:Technische Universität <München>: TUM-I 9315
Schlagworte:
Logic programming
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Abstract: "Declarative languages for deductive and object- oriented databases require some high-level mechanism for specifying semantic control knowledge. This paper proposes user-supplied subsumption information as a paradigm to specify desired, prefered [sic], or useful deductions at the meta level. For this purpose we augment logic programming by subsumption relations and succeed to extend the classical theorems for least models, fixpoints and bottom-up evaluation accordingly. Moreover, we can provide a differential fixpoint operator for efficient query evaluation. This operator discards subsumed tuples on the fly. We also exemplify the ease of use of this programming methodology. In particular, we demonstrate how heuristic AI search procedures can be integrated into logic programming in this way."
Beschreibung:Literaturverz. S. 20 - 22
Beschreibung:22 S.
graph. Darst.