Browsing by Subject "Deductive Databases"
Now showing items 1-5 of 5
-
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 ... -
Linearisability on datalog programs
(2003)Linear Datalog programs are programs whose clauses have at most one intensional atom in their bodies. We explore syntactic classes of Datalog programs (syntactically non-linear) which turn out to express no more than the ... -
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 ... -
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. -
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 ...