Abstract
We consider the problem of transformations of logic programs without function symbols (database logic programs) into a special subclass, namely linear logic programs. Linear logic programs are defined to be the programs whose rules have at most one intentional atom in their bodies. a) We investigate linearizability of several syntactically defined subclasses of programs and present both positive and negative results (i.e. demonstrate programs that cannot be transformed into a linear program by any transformation technique), and b) We develop an algorithm which transforms any program in a specific subclass namely the piecewise logic programs into a linear logic program.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
F. Afrati and S. Cosmadakis. Expressiveness of restricted recursive queries. In Proc. 21st ACM Symp. on Theory of Computing, pages 113–126, 1989.
F. Afrati, S. Cosmadakis, and M. Yannakakis. On datalog vs. polynomial time. J. Computer and Systems Sciences, 51(2):117–196, 1995.
F. Afrati, S. Cosmadakis, and M. Yannakakis. On datalog vs. polynomial time. In Proc. 10th ACM Symp. on Principles of Database Systems, pages 113–126, 1991.
F. Afrati and C. H. Papadimitriou. The parallel complexity of simple chain queries. In Proc. 6th ACM Symp. on Principles of Database Systems, pages 210–213, 1987.
F. Bancilhon and R. Ramakrishnan. An amateur's introduction to recursive query processing strategies. In Proc. ACM Conf. on Management of Data, pages 16–52, 1986.
S. A. Cook. An observation on time-storage trade off. J. Computer and System Sciences, 9:308–316, 1974.
S. S. Cosmadakis and P. C. Kanellakis. Parallel evaluation of recursive rule queries. In Proc. 5th ACM Symp. on Principles of Database Systems, pages 280–293, 1986.
M. Gergatsoulis. Logic program transformations: Rules and application strategies. PhD thesis, Dept. of Computer Science, University of Athens, 1994. (In Greek).
M. Gergatsoulis and M. Katzouraki. Unfold/fold transformations for definite clause programs. In Programming Language Implementation and Logic Programming (PLILP'94), LNCS 844, Pages 340–354, Spinger-Verlang, 1994.
Y. E. Ioannidis. A time bound on the materialization of some recursively defined views. In Proc. 11th Int'l Conf. on Very Large Data Bases, pages 219–226, 1985.
J-L. Lasser, M. J. Maher, and K. Marriott. Unification revisited. In Jack Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 587–625, Morgan Kaufmann Publishers,Inc., 1988.
J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, 1987.
J. F. Naughton. Data independent recursion in deductive databases. In Proc. 5th ACM Symp. on Principles of Database Systems, pages 267–279, 1986.
J. F. Naughton and Y. Sagiv. A decidable class of bounded recursions. In Proc. 6th ACM Symp. on Principles of Database Systems, pages 227–236, 1987.
A. Pettorossi and M. Proietti. Transformation of logic programs: Foundations and techniques. The Journal of Logic Programming, 19/20:261–320, May/July 1994.
M. Proietti and A. Pettorossi. The loop absorption and the generalization strategies for the development of logic programs and partial deduction. The Journal of Logic Programming, 16(1&2):123–162, May 1993.
M. Proietti and A. Pettorossi. Synthesis of eureka predicates for developing logic programs. In LNCS no. 432, Proc. of the 3rd European Symposium on Programming, pages 306–325, Springer-Verlag, 1990.
H. Tamaki and T. Sato. Unfold/fold transformations of logic programs. In Second International Conference on Logic Programming, pages 127–138, 1984.
J. D. Ullman and A. Van Gelder. Parallel complexity of logical query programs. In Proc. 27th IEEE Symp. on Foundations of Comp. Sci., pages 438–454, 1986.
M. Y. Vardi. The complexity of relational query languages. In Proc. 14th ACM Symp. on Theory of Computing, pages 137–146, 1982.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Afrati, F., Gergatsoulis, M., Katzouraki, M. (1996). On transformations into linear database logic programs. In: Bjørner, D., Broy, M., Pottosin, I.V. (eds) Perspectives of System Informatics. PSI 1996. Lecture Notes in Computer Science, vol 1181. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62064-8_36
Download citation
DOI: https://doi.org/10.1007/3-540-62064-8_36
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62064-8
Online ISBN: 978-3-540-49637-3
eBook Packages: Springer Book Archive