A Transformation Technique for Datalog Programs Based on Non-deterministic Constructs

Authors:
Petros Potikas;Panos Rondogiannis;Manolis Gergatsoulis
Affiliations:
-;-;-
Venue:
LOPSTR '01 Selected papers from the 11th International Workshop on Logic Based Program Synthesis and Transformation
Year:
2001

Citing 17
Cited 3

Foundations of logic programming; (2nd extended ed.)

Foundations of logic programming; (2nd extended ed.)
Principles of database and knowledge-base systems, Vol. I

Principles of database and knowledge-base systems, Vol. I
The generalized counting method for recursive logic queries

Theoretical Computer Science - First International Conference on Database Theory, Rome, September 1986
Expressiveness of restricted recursive queries

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On the power of magic

Journal of Logic Programming
Towards a unified theory of intensional logic programming

Journal of Logic Programming
Finite representation of infinite query answers

ACM Transactions on Database Systems (TODS)
An analysis of magic sets and related optimization strategies for logic queries

Journal of the ACM (JACM)
Counting methods for cyclic relations

Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Semantics and expressive power of nondeterministic constructs in deductive databases

Journal of Computer and System Sciences
The Branching-Time Transformation Technique for Chain Datalog Programs

Journal of Intelligent Information Systems
Programming with non-determinism in deductive databases

Annals of Mathematics and Artificial Intelligence
Unfold/Fold Transformations For Definite Clause Programs

PLILP '94 Proceedings of the 6th International Symposium on Programming Language Implementation and Logic Programming
On Transformations into Linear Database Logic Programs

Proceedings of the Second International Andrei Ershov Memorial Conference on Perspectives of System Informatics
Higher-order functional languages and intensional logic

Journal of Functional Programming
First-order functional languages and intensional logic

Journal of Functional Programming
Branching-time logic programming: the language Cactus and its applications

Computer Languages

Temporal stratification tests for linear and branching-time deductive databases

Theoretical Computer Science
A Value-propagating Transformation Technique for Datalog Programs Based on Non-Deterministic Constructs

Fundamenta Informaticae
A Value-propagating Transformation Technique for Datalog Programs Based on Non-Deterministic Constructs

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 which we believe opens up a promising new direction of research in the area of value-propagating Datalog optimizations. One of the novel characteristics of the proposed approach is that the target language is DatalognS extended with choice predicates, a form of non-deterministic construct that was originally introduced in the area of intensional logic programming.