Skip to main content
SpringerLink
Log in

Effective implementation of negation in database logic query languages

  • Part IV: Deductive Detabases
  • Chapter
  • First Online:
LOGIDATA+: Deductive Databases with Complex Objects

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

Abstract

Total stable models provide a powerful semantics for DATALOG− programs which increases the expressive power of current database query language by means of non-determinism. An efficient algorithm for determining one of stable models of a DATALOG− programs, if any, is presented so that stable models may have also a practical interest.

Work partially supported by the CNR project “Sistemi Informatici e Calcolo Parallelo”, subproject ”LOGIDATA+”.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Apt, K., Bair, H., and Walker, A., ”Towards a Theory of Declarative Knowledge”, in Foundations of Deductive Databases and Logic Programming, J. Minker (Ed.), Morgan Kauffman, pp. 89–148, 1988.

    Google Scholar 

  2. Chandra, A., and D. Harel, ”Horn Clauses and Generalization”, Journal of Logic Programming 2, 1, pp. 320–340, 1985.

    Google Scholar 

  3. Clark, K.L., ”Negation as Failure”, in Logic and Data Bases, (Gallaire and Minker, eds), Plenum Press, New York, pp. 293–322, 1978.

    Google Scholar 

  4. Fitting, M., and M. Ben-Jacob, ”Stratified and Three-valued Logic Programming Semantics”, Proc. 5th Int. Conf. and Symp. on Logic Programming, MIT Press, Cambridge, Ma, pp. 1054–1068, 1988.

    Google Scholar 

  5. Garey, M. R., and Johnson, D.S., Computers and Intractability, W.H. Freeman and Company, 1979.

    Google Scholar 

  6. Gelfond, M., and Lifschitz, V., ”The Stable Model Semantics for Logic Programming”, Proc. 5th Int. Conf. and Symp. on Logic Programming, MIT Press, Cambridge, Ma, pp. 1070–1080, 1988.

    Google Scholar 

  7. Lloyd, J. W., Foundations of Logic Programming, Springer-Verlag, 1987.

    Google Scholar 

  8. Leone, N., Rullo, P., ”Safe Computation of the Weil-Founded Semantics of DATALOG Queries”, Information System 17, 1, 1992.

    Google Scholar 

  9. Naqvi, S.A., ”A Logic for Negation in Database Systems”, in Foundations of Deductive Databases and Logic Programming, (Minker, J., ed.), Morgan Kaufman, Los Altos, 1987.

    Google Scholar 

  10. Przymusinski, T.C., ”On the Declarative Semantics of Stratified Deductive Databases and Logic Programs”, in Foundations of Deductive Databases and Logic Programming, (Minker, J. ed.), Morgan Kaufman, Los Altos, pp. 193–216, 1987.

    Google Scholar 

  11. Przymusinski, T.C., “Every logic program has a natural stratification and an iterated fixed point model”, Proc. ACM Symp. on Principles of Database Systems, pp. 11–21, 1989.

    Google Scholar 

  12. Przymusinski T.C., ”Extended stable semantics for normal and disjunctive programs”, Proc. of the 7th Int. Conf. on Logic Programming, MIT Press, Cambridge, 1990, pp. 459–477.

    Google Scholar 

  13. Sacca, D. and Zaniolo, C, ”Partial Models, Stable Models and Non-Determinism in Logic Programs with Negation”, Proc. ACM Symp. on Principles of Database Systems, pp. 205–218,1990.

    Google Scholar 

  14. Sacca, D. and Zaniolo, C., ”Determinism and Non-Determinism in Logic Programs with Negation”, unpublished manuscript, 1992.

    Google Scholar 

  15. Tarski, A., ”A Lattice Theoretical Fixpoint Theorem and its Application”, Pacific Journal of Mathematics 5, pp. 285–309, 1955.

    Google Scholar 

  16. Ullman, J, D., Principles of Database and Knowledge-Base Management System, Academic Press, 1988.

    Google Scholar 

  17. Van Gelder, A., ”Negation as Failure Using Tight Derivations for Logic Programs”, Proc. 3rd IEEE Symp. on Logic Programming, Springer-Verlag, pp. 127–138, 1986.

    Google Scholar 

  18. Van Gelder A., Ross K., and J.S. Schlipf, ”Unfounded Sets and Well-Founded Semantics for General Logic Programs”, ACM SIGMOD-SIGACT Symp. on Principles of Database Systems, pp. 221–230, 1988.

    Google Scholar 

  19. Van Gelder A., Ross K., and J.S. Schlipf, ”The Well-Founded Semantics for General Logic Programs”, Journal of the ACM 38, 3, pp. 620–650, 1991.

    Google Scholar 

  20. You,J-H. and L.Y. Yuan, ”Three-Valued Formalization in Logic Programs: is it really needed?”, ACM SIGMOD-SIGACT Symp. on Principles of Database Systems, pp. 172–181, 1990

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DEIS-UNICAL, 87030, Rende, Italy

    Nicola Leone & Domenico Saccà

  2. ISI-CNR, 87030, Rende, Italy

    Massimo Romeo

  3. Dip. di Matematica-UNICAL, 87030, Rende, Italy

    Pasquale Rullo

Authors
  1. Nicola Leone
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Massimo Romeo
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Pasquale Rullo
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Domenico Saccà
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Paolo Atzeni

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Leone, N., Romeo, M., Rullo, P., Saccà, D. (1993). Effective implementation of negation in database logic query languages. In: Atzeni, P. (eds) LOGIDATA+: Deductive Databases with Complex Objects. Lecture Notes in Computer Science, vol 701. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0021896

Download citation

  • DOI: https://doi.org/10.1007/BFb0021896

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56974-9

  • Online ISBN: 978-3-540-47844-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation