The Branching-Time Transformation Technique for Chain Datalog Programs

Authors: Rondogiannis P.¹; Gergatsoulis M.²

Source: Journal of Intelligent Information Systems, Volume 17, Number 1, November 2001 , pp. 71-94(24)

Publisher: Springer

Buy & download fulltext article:

Price: $47.00 plus tax (Refund Policy)

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.

Keywords: deductive databases; chain programs; program transformation; temporal logic programming; branching time

Language: English

Document Type: Regular paper

Affiliations: 1: Dept. of Informatics and Telecommunications, University of Athens, 15784 Athens, Greece. prondo@di.uoa.gr 2: Inst. of Informatics and Telecommunications, National Centre for Scientific Research (NCSR) ‘Demokritos’, 15310 A. Paraskevi Attikis, Athens, Greece. manolis@iit.demokritos.gr

Publication date: 2001-11-01