Modular acyclicity and tail recursion in logic programs

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 1991, Pages 92-101

  Ross, Kenneth A ^a  

^a STANFORD UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84910830143     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/113413.113422     Document Type: Conference Paper

References (20)

1. K.R. Apt and M. Bezem. Acyclic programs. In Proceedings of the Seventh International Conference on Logic Programming, 1990.
2. F. Bry. Query evaluaton in recursive databases: Bottom-up and top-down reconciled. In Proceedings of the First International Conference on Deductive and Object-Oriented Databases, 1989.
3. A. Brodsky and Y. Sagiv. Inference of monotonicity constrint sin data - log programs . In Proceedings of the Eighth ACM Symposium on Principles of Database Systems, 1989.
4. L. Cavedon. Continuity, consistency, and completeness properties for logic programs . In Proceedings of the Sixth International Conference on Logic Programming, 1989.
5. P. Cholak . Post correspondence problem and prolog programs, manuscript, Dept . of Mathematics, University of Wisconsin, 1988.
6. W. Chen, M. Kifer, and D. S. Warren. Hilog: A first order semantics for higher-order logic programming constructs. In Proc. North American Logic Programming Conference, 1989.
7. M. Fitting . A Kripke-Kleene semantics for logic programs. Journal of Logic Programming, 2(4):295-312, 1985.
8. D. B. Kemp, K. Ramamohanarao, and Z. Somogyi . Right -, left - and multi - line arrule trans for mations that maintain context information . I n Proceedings of the International Conference on Very Large Databases, 1990.
9. J. W. Lloyd. Foundations of Logic Programming. Springer-Verlag, New York, 2nd edition, 1987.
10. I. S. Mumick, H. Pirahesh, and R. Ramakrishnan. The magic of duplicates and aggregates. In Proceedings of the International Conference on Very Large Databases, 1990.
11. M. J. Maher and R. Ramakrishnan. Déjà vu in fixpoints of logic programs. In Proceedings of the North American Conference on Logic Programming, 1989.
12. I . S . Mumick . Right - linear and overbound queries. (unpublished manuscript), 1990.
13. J. F. Naughton, R. Ramakrishnan, Y. Sagiv, and J. D. Ullman. Argument reduction by factoring. In Proceedings of the International Conference on Very Large Databases, 1989.
14. J. F. Naughton, R. Ramakrishnan, Y. Sagiv, and J. D. Ullman. Efficient evaluation of right-, left-, and multi-linear rules. In Proceedings of the ACM-SIGMOD International Conference on Management of Data, 1989.
15. R. Ramakrishnan . Magic templates: A spell binding approach to logic programs. In Proc. Fifth International Conference and Symposium on Logic Programming, 1988.
16. K . A . Ross. Modular stratification and magicsets for data log programs with negation. In Proceedings of the Ninth ACM Symposium on Principles of Database Systems, 1990.
17. Y. Sagiv, 1990. (personal communication) .
18. O. Shmueli . Decidability and expressiveness aspect so flogic queries. I n Proceedings of the Sixth ACM Symposium on Principles of Database Systems, 1987.
19. J. Ullman. Bottom-up beats top-down for datalog. In Proceedings of the Eighth ACM Symposium on Principles of Database Systems, 1989.
20. J. D. Ullman. Principles of Database and Knowledge Base Systems. Computer Science Press, Rockville, M D, 1989.