The Branching-Time Transformation Technique for Chain Datalog Programs

The branching-time transformation technique has proven to be an efficient approach for implementing functional programming languages. In this paper we demonstrate that such a technique can also be defined for logic programming languages. More specifically, we first introduce Branching Datalog, a lan...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Journal of intelligent information systems Jg. 17; H. 1; S. 71 - 94
Hauptverfasser: Rondogiannis, Panos, Gergatsoulis, Manolis
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York Springer Nature B.V 01.11.2001
Schlagworte:
Algorithms
Informatics
Logic programming
Optimization techniques
Programming languages
Queries
Semantics
Studies
Temporal logic
ISSN:0925-9902, 1573-7675
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:The branching-time transformation technique has proven to be an efficient approach for implementing functional programming languages. In this paper we demonstrate that such a technique can also be defined for logic programming languages. More specifically, we first introduce Branching Datalog, a language that can be considered as the basis for branching-temporal deductive databases. We then present a transformation algorithm from Chain Datalog programs to the class of unary Branching Datalog programs with at most one IDB atom in the body of each clause. In this way, we obtain a novel implementation approach for Chain Datalog, shedding at the same time new light on the power of branching-time logic programming. [PUBLICATION ABSTRACT]
Bibliographie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0925-9902
1573-7675
DOI:10.1023/A:1012502800961