Optimization of logic queries with MIN and MAX predicates

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1495, Issue , 1998, Pages 188-202

  Greco, Sergio ^a   Zaniolo, Carlo ^b   Ganguly, Sumit ^c  

^a UNIVERSITY OF CALABRIA   (Italy)

^b Engineering IV   (United States)

^c RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

MONOTONICITY CONSTRAINT; QUERY EQUIVALENCE;

ARTIFICIAL INTELLIGENCE;

EID: 84949008851     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0056001     Document Type: Conference Paper

References (22)

1. K. Apt, H. Blair, and A. Walker. Towards a theory of declarative programming. In Foundations of Deductive Databases and Logic Programming (Minker, ed.), 1988.
2. M.P. Consens and A.O. Mendelzon. Low complexity aggregation in graphlog and Datalog. Theoretical Computer Science, 1993.
3. S. W. Dietrich. Shortest Path by Approximation in Logic Programs. ACM Letters on Programming Languages and Systems Vol 1, No, 2, pages 119-137, June 1992.
4. S. J. Finkelstein, N. Mattos, I.S. Mumick and H. Pirahesh. Expressing Recursive Queries in SQL. ISO - 1EC JTC1/SC21 WG3 DBL MCI Tec. Rep., March, 1996.
5. S. Ganguly, S. Greco, and C. Zaniolo. Extrema predicates in deductive databases. J. Computer and System Science, 1995.
6. M. Gelfond and V. Lifschitz. The stable model semantics of logic programming. In Proc. of the Fifth Intern. Conf. on Logic Programming, pages 1070-1080, 1988.
7. S. Greco, S. Ganguly, and C. Zaniolo. Greedy by Choice. Proc. Eleventh ACM PODS Conf., pages 109-118, 1991.
8. S. Greco, D. Saccà, and C. Zaniolo. Dynamic Programming optimization for Logic Programs with Aggregates. Proc. Int. Logic Progr. Syrup., pages 109-118, 1993.
9. D. Kemp and P. Stuckey. Semantics of Logic Programs with Aggregates. In Proc. of the 1991 Intern. Symposium on Logic Programming, pages 387-341, 1991.
10. I.S. Mumick, H. Pirahesh, and R. Ramakrishnan. The magic of duplicates and aggregates. In Proc. 16th Conf. on Very Large Data Bases, pages 264-277, 1990.
11. I.S. Mumick, and O. Shmueli. How Expressive is Stratified Aggregation. In Annals of Mathematics and Artificial Intelligence, 1995.
12. H. Przymusinska and T.C. Przymusinski. Weakly perfect model semantics for logic programs. In Proc. Fifth lntern. Conf. on Logic Progr., pages 1106-1120, 1988.
13. K. Ross. A Procedural Semantics for the Well-Founded Negation in Logic Programs. In Proc. ACM Syrup. on Principles of Database Systems, pages 22-33, 1989.
14. K. Ross and Y. Sagiv. Monotonic Aggregation in Deductive Databases. Proc. Eleventh ACM PODS Conf., 1992.
15. D. Saccà and C. Zaniolo. Stable models and non-determinism in logic programs with negation. In Proc. of the Ninth ACM PODS Conf., pages 205-217, 1990.
16. S. Sudarshan and R. Ramakrishnan. Aggregation and relevance in deductive databases. In Proc. of the 17th Conf. on Very Large Data Bases, 1991.
17. R. Ramakrishnan, D. Srivastava, and S. Sudarshan. CORAL: Control, Relations and Logic. In Proc. of Intl. Conf. on Very Large Data Bases, 1992.
18. S. Sudarshan, D. Srivastava, R. Ramakrishnan and C. Beeri, Extending Well-Founded and Valid Semantics for Aggregation, In Proc. of the Int. Logic Programruing Symposium, pages 591-608, 1992.
19. J. Ullman. Principles of Data and Knowledge-Base Systems, volume 1 and 2. Computer Science Press, New York, 1988.
20. A. Van Gelder, K.A. Ross, and J.S. Schlipf. The well-founded semantics for general logic programs. Journal of ACM, 38(3):620-650, 1991.
21. A. Van Gelder. Foundation of Aggregation in Deductive Databases In Proceedings of the Third Int. Conf. on Deductive and O-O Databases, Phoenix, AZ, 1993.
22. C. Zaniolo, N. Arni, and K. Ong. Negation and aggregates in recursive rules: the LDL++ approach, In Proc. Int. Conf. od Deductive and Object Oriented Databases, pp. 204-221, 1993.