This Article 
 Bibliographic References 
 Add to: 
Linearizing Some Recursive Logic Programs
February 1995 (vol. 7 no. 1)
pp. 137-149

Abstract—We give in this paper a sufficient condition under which the least fixpoint of the equation X=a+f(X)X equals the least fixpoint of the equation X=a+f(a)X. We then apply that condition to recursive logic programs containing chain rules: we translate it into a sufficient condition under which a recursive logic program containing n≥ 2 recursive calls in the bodies of the rules is equivalent to a linear program containing at most one recursive call in the bodies of the rules. We conclude with a discussion comparing our condition with the other approaches to linearization studied in the literature.

[1] S. Abiteboul,“Boundedness is undecidable for Datalog programs with a single recursiverule,” IPL 32, 1989, pp. 281-287.
[2] K. Apt, "Logic Programming," Handbook of Theoretical Computer Science, vol. B, J. van Leeuven, ed., pp. 493-574.Cambridge, Mass.: MIT Press, 1990.
[3] K. Apt, H.A. Blair, and A. Walker, "Towards a Theory of Declarative Knowledge," Foundations of Deductive Databases and Logic Programming, J. Minker, ed., pp. 89-148. Morgan Kaufmann, 1988.
[4] F. Bancilhon,C. Beeri,P. Kanellakis,, and R. Ramakrishnan,“Bounds on the propagation of selection into logic programs,” Proc. 6th ACM Symp. on Principles of Database Systems, 1987, pp. 214-226.
[5] S. Cosmadakis,H. Gaifman,P. Kanellakis,, and M. Vardi,“Decidable optimizations for database logic programs,” Proc. 20th Ann. A.C.M. Symp. on Theory of Computing, 1988, pp. 447-490.
[6] I. Guessarian,“Deciding boundedness for uniformly connected datalog programs,” Proc. ICDT’90, Lect. Notes in Comput. Sci. 470, 1990, pp. 395-405.
[7] J. Han and W. Lu,“Asynchronous chain recursions,” IEEE Trans. Knowl. and Data Eng., vol. 1, 1989, pp. 185-195.
[8] Y.E. Ioannidis,“Commutativity and its role in the processing of linear recursion,” Jour. Logic Prog.
[9] Y.E. Ioannidis and E. Wong,“Towards an algebraic theory of recursion,” Jour. Assoc. Comput. Mac. vol. 38, 1991, pp. 329-381.
[10] J.M. Kerisit,“La méthode d’Alexandre: une technique de déduction,” Ph.D. Thesis, Paris, 1988.
[11] J.W. Lloyd, Foundations of Logic Programming, Springer Series in Symbolic Computation, second ed. New York: Springer-Verlag, 1987.
[12] Z. Manna,Mathematical theory of computation,New York: MacGraw Hill, 1974.
[13] S. Naqvi and S. Tsur, A Logical Language for Data and Knowledge Bases.New York: Computer Science Press, 1989.
[14] R. Ramakrishnan,Y. Sagiv,J.D. Ullman,, and M.Y. Vardi,“Proof-tree transformation theorems and their applications,” Proc. 8th. ACM Symp. on Principles of Database Systems, 1989, pp. 172-182.
[15] Y. Saraiya,“Linearizing nonlinear recursions in polynomial time,” Proc. 8th ACM Symp. on Principles of Database Systems, 1989, pp. 182-190; see also Ph. D. Thesis, Stanford Univ., 1991.
[16] O. Shmueli,“Decidability and expressiveness aspects of logic queries,” Proc. 6th ACM Symp. on Principles of Database Systems, 1987, pp. 237-249.
[17] D. Troy,C. Yu,, and W. Zhang,“Linearization of nonlinear recursive rules,” IEEE Trans. Soft. Eng., vol. 15, 1989, pp. 1109-1119.
[18] J.D. Ullman,Database and knowledge-base systems, 3rd. ed. New York: Computer Science Press, 1989.
[19] J.D. Ullman and A. Van Gelder,“Parallel complexity of logical query programs,” Algorithmica, vol. 3, 1988, pp. 5-42.
[20] W. Zhang,C.T. Yu,D. Troy,“Necessary and sufficient conditions to linearize doubly recursive programsin logic databases,” ACM-ToDS, vol. 15, 1990, pp. 459-482.

Index Terms:
Datalog program, chain rule program, linear program, fixpoint, semantics, rational languages and functions, linearization.
Irène Guessarian, Jean-Eric Pin, "Linearizing Some Recursive Logic Programs," IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 1, pp. 137-149, Feb. 1995, doi:10.1109/69.368513
Usage of this product signifies your acceptance of the Terms of Use.