Search
Now showing items 1-2 of 2
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 ...
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.