
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Irène Guessarian, JeanEric Pin, "Linearizing Some Recursive Logic Programs," IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 1, pp. 137149, February, 1995.  
BibTex  x  
@article{ 10.1109/69.368513, author = {Irène Guessarian and JeanEric Pin}, title = {Linearizing Some Recursive Logic Programs}, journal ={IEEE Transactions on Knowledge and Data Engineering}, volume = {7}, number = {1}, issn = {10414347}, year = {1995}, pages = {137149}, doi = {http://doi.ieeecomputersociety.org/10.1109/69.368513}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Knowledge and Data Engineering TI  Linearizing Some Recursive Logic Programs IS  1 SN  10414347 SP137 EP149 EPD  137149 A1  Irène Guessarian, A1  JeanEric Pin, PY  1995 KW  Datalog program KW  chain rule program KW  linear program KW  fixpoint KW  semantics KW  rational languages and functions KW  linearization. VL  7 JA  IEEE Transactions on Knowledge and Data Engineering ER   
[1] S. Abiteboul,“Boundedness is undecidable for Datalog programs with a single recursiverule,” IPL 32, 1989, pp. 281287.
[2] K. Apt, "Logic Programming," Handbook of Theoretical Computer Science, vol. B, J. van Leeuven, ed., pp. 493574.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. 89148. 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. 214226.
[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. 447490.
[6] I. Guessarian,“Deciding boundedness for uniformly connected datalog programs,” Proc. ICDT’90, Lect. Notes in Comput. Sci. 470, 1990, pp. 395405.
[7] J. Han and W. Lu,“Asynchronous chain recursions,” IEEE Trans. Knowl. and Data Eng., vol. 1, 1989, pp. 185195.
[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. 329381.
[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: SpringerVerlag, 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,“Prooftree transformation theorems and their applications,” Proc. 8th. ACM Symp. on Principles of Database Systems, 1989, pp. 172182.
[15] Y. Saraiya,“Linearizing nonlinear recursions in polynomial time,” Proc. 8th ACM Symp. on Principles of Database Systems, 1989, pp. 182190; 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. 237249.
[17] D. Troy,C. Yu,, and W. Zhang,“Linearization of nonlinear recursive rules,” IEEE Trans. Soft. Eng., vol. 15, 1989, pp. 11091119.
[18] J.D. Ullman,Database and knowledgebase 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. 542.
[20] W. Zhang,C.T. Yu,D. Troy,“Necessary and sufficient conditions to linearize doubly recursive programsin logic databases,” ACMToDS, vol. 15, 1990, pp. 459482.