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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Journal of intelligent information systems Ročník 17; číslo 1; s. 71 - 94
Hlavní autoři: Rondogiannis, Panos, Gergatsoulis, Manolis
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York Springer Nature B.V 01.11.2001
Témata:
Algorithms
Informatics
Logic programming
Optimization techniques
Programming languages
Queries
Semantics
Studies
Temporal logic
ISSN:0925-9902, 1573-7675
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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]
Bibliografie:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0925-9902
1573-7675
DOI:10.1023/A:1012502800961