Search
Now showing items 1-6 of 6
The branching-time transformation technique for Chain Datalog programs
(2001)
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 ...
Temporal disjunctive logic programming
(2001)
In this paper we introduce the logic programming language Disjunctive Chronolog which combines the programming paradigms of temporal and disjunctive logic programming. Disjunctive Chronolog is capable of expressing dynamic ...
A transformation technique for datalog programs based on non-deterministic constructs
(2001)
Recently, a novel transformation technique for Datalog programs, called the branching-time transformation, was introduced by the authors. In this paper we propose a significant extension of the branching-time transformation ...
A value-propagating transformation technique for Datalog programs based on non-deterministic constructs
(2006)
The branching-time transformation is a recent technique for optimizing Chain Datalog programs. In this paper we propose a significant extension of the branching-time transformation which we believe opens up a promising new ...
Unfold/fold transformations for disjunctive logic programs
(1997)
Unfold/fold transformation rules for disjunctive logic programs are proposed in this paper. Our transformation rules preserve the meaning of the programs.
Temporal stratification tests for linear and branching-time deductive databases
(2005)
We consider the problem of extending temporal deductive databases with stratified negation. We argue that the classical stratification test for deductive databases is too restrictive when one shifts attention to the temporal ...