Article thumbnail

The Branching-Time Transformation Technique for Chain Datalog Programs

By Panos Rondogiannis, Manolis Gergatsoulis and For Chain Datalog Programs

Abstract

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

Topics: deductive databases, chain programs, program transformation, temporal logic programming, branching time
Year: 2001
OAI identifier: oai:CiteSeerX.psu:10.1.1.15.1954
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.di.uoa.gr/~prondo/p... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.