Skip to main content
SpringerLink
Log in
Book cover

International Conference on Deductive and Object-Oriented Databases

DOOD 1993: Deductive and Object-Oriented Databases pp 204–221Cite as

Negation and aggregates in recursive rules: the LDL++ approach

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 760))

Abstract

The problem of allowing non-monotonic constructs, such as negation and aggregates, in recursive programs represents a difficult challenge faced by current research in deductive databases. In this paper, we present a solution that combines generality with efficiency, as demonstrated by its implementation in the new LDL++ system. A novel and general treatment of set aggregates, allowing for user-defined aggregates, is also presented.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.V. Aho, J.E. Hopcropt, and J.D. Ullmann. The Design and analysis of Computer Algorithms. Addison-Wesley, 1974.

    Google Scholar 

  2. N. Arni, K. Ong, S. Tsur and C. Zaniolo. The LDL++ System: Rationale, Technology and Applications. Submitted for publication.

    Google Scholar 

  3. Chimenti, D. et al., “The LDL System Prototype,” IEEE Journal on Data and Knowledge Engineering, vol. 2, no. 1, pp. 76–90, March 1990.

    Google Scholar 

  4. M.P. Consens and A.O. Mendelzon. Low complexity aggregation in graphlog and datalog. In Proceedings of the third International Conference on Database Theory, 1990.

    Google Scholar 

  5. S. Ganguly, S. Greco, and C. Zaniolo. Minimum and Maximum Predicates in Logic Programming. In Proceedings of the Tenth ACM Symposium on Principles of Database Systems, pages 154–113, 1991.

    Google Scholar 

  6. S. Ganguly, S. Greco, and C. Zaniolo. Propagation of Extrema Predicates into Recursive Logic Programs. In Unpublished Manuscript, 1992.

    Google Scholar 

  7. M. Gelfond and V. Lifschitz. The stable model semantics of logic programming. In Proceedings of the Fifth Intern. Conference on Logic Programming, pages 1070–1080, 1988.

    Google Scholar 

  8. F. Giannotti, D. Pedreschi, D. Saccà, and C. Zaniolo. Nondeterminism in deductive databases. In Proc. 2nd Int. Conf. on Deductive and Object-Oriented Databases, 1991.

    Google Scholar 

  9. S. Greco, C. Zaniolo, and S. Ganguly. Greedy by Choice. In Proceedings of the Eleventh ACM Symposium on Principles of Database Systems, pages 105–163, 1992.

    Google Scholar 

  10. D.B. Kemp and P.J. Stackey. Semantics of Logic Programs with Aggregates. In Proceedings 1991 Int. Logic Programming Symposium, pages 338–401, 1991.

    Google Scholar 

  11. R. Krishnamurthy and S. Naqvi. “Non-deterministic choice in Datalog,” In Proceedings 3rd Int. Conference on Data and Knowledge Bases, 1988.

    Google Scholar 

  12. 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.

    Google Scholar 

  13. A. Van Gelder. The Well-Founded Semantics of Aggregation. In Proceedings of the Eleventh ACM Symposium on Principles of Database Systems, pages 127–138, 1992.

    Google Scholar 

  14. P.G. Kolaitis and C.H. Papadimitriou, Why not negation by fixpoint?, JCSS, 43(1), 125–144, 1991.

    Google Scholar 

  15. Phipps, G., M.A., Derr and K. A. Ross, “Glue-Nail: a Deductive Database System,” Proc. 1991 ACM-SIGMOD Conference on Management of Data, pp. 308–317 (1991).

    Google Scholar 

  16. T. Przymusinski. On the declarative and procedural semantics of stratified deductive databases. In J. Minker, editor, Foundations of Deductive Databases and Logic Programming, pages 193–216. Morgan-Kaufman, Los Altos, CA, 1988.

    Google Scholar 

  17. A. Przymusinska and T. Przymusinski. Weakly Perfect Model Semantics for Logic Programs. In Proceedings of the Fifth Intern. Conference on Logic Programming, pages 1106–1122, 1988.

    Google Scholar 

  18. S. A. Naqvi, S. Tsur “A Logical Language for Data and Knowledge Bases”, W. H. Freeman, 1989.

    Google Scholar 

  19. K.A. Ross, and Y. Sagiv. Monotonic Aggregation in Deductive Databases. In Proceedings of the Eleventh ACM Symposium on Principles of Database Systems, pages 127–138, 1992.

    Google Scholar 

  20. K.A. Ross, Modular Stratification and Magic Sets for Datalog Programs, In Proceedings of the Ninth ACM Symposium on Principles of Database Systems, pages 160–171, 1990.

    Google Scholar 

  21. D. Saccà and C. Zaniolo. Stable models and non-determinism in logic programs with negation. In Proceedings of the Ninth ACM Symposium on Principles of Database Systems, pages 205–217, 1990.

    Google Scholar 

  22. Ramakrishan, R., Srivastava, D. and Sudarshan, S., “CORAL: A Deductive Database Programming Language,” Proc. VLDB'92 Int. Conf, pp. 238–250, 1992.

    Google Scholar 

  23. Tsur S., ‘Deductive Databases in Action,’ Proc. 10th, ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 205–218, 1990.

    Google Scholar 

  24. Zaniolo, C., Intelligent Databases: Old Challenges and New Opportunities, Journal of Intelligent Information Systems, 1, 271–292 (1992).

    Google Scholar 

  25. Zaniolo, C., A Unified Semantics for Deductive Databases and Active Databases, Procs. Workshop on Rules in Database Systems, Edinburgh, U.K., 1993.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Department, University of California, 90024, Los Angeles, California

    Carlo Zaniolo

  2. Microelectronics and Computer Technology Corporation, 78759, Austin, Texas

    Natraj Arni & Kayliang Ong

Authors
  1. Carlo Zaniolo
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Natraj Arni
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Kayliang Ong
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Stefano Ceri Katsumi Tanaka Shalom Tsur

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zaniolo, C., Arni, N., Ong, K. (1993). Negation and aggregates in recursive rules: the LDL++ approach. In: Ceri, S., Tanaka, K., Tsur, S. (eds) Deductive and Object-Oriented Databases. DOOD 1993. Lecture Notes in Computer Science, vol 760. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57530-8_13

Download citation

  • DOI: https://doi.org/10.1007/3-540-57530-8_13

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57530-6

  • Online ISBN: 978-3-540-48212-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation