Skip to main content
SpringerLink
Log in

Datalog with nested rules

  • Conference paper
  • First Online:
Logic Programming and Knowledge Representation (LPKR 1997)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1471))

Abstract

This paper presents an extension of disjunctive datalog (Datalog∀) by nested rules. Nested rules are (disjunctive) rules where elements of the head may be also rules. Nested rules increase the knowledge representation power of Datalog∀ both from a theoretical and from a practical viewpoint. A number of examples show that nested rules allow to naturally model several real world situations that cannot be represented in Datalog∀. An in depth analysis of complexity and expressive power of the language shows that nested rules do increase the expressiveness of Datalog∀ without implying any increase in its computational complexity.

This work has been supported in part by FWF (Austrian Science Funds) under the project P11580-MAT “A Query System for Disjunctive Deductive Databases”; by the Istituto per la Sistemistica e l'Informatica, ISI-CNR; and by a MURST grant (40% share) under the project “Interdata.”

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. Abiteboul, S., Hull, R., Vianu, V. (1995), Foundations of Databases. Addison-Wesley.

    Google Scholar 

  2. Baral, C. and Gelfond, M. (1994), Logic Programming and Knowledge Representation Journal of Logic Programming, 19/20, 73–148.

    Article  MathSciNet  Google Scholar 

  3. S. Brass and J. Dix (1997), Characterizations of the Stable Semantics by Partial Evaluation. Journal of Logic Programming, 32(3):207–228.

    Article  MATH  MathSciNet  Google Scholar 

  4. S. Brass, J. Dix, and T.C. Przymusinski (1996), Super Logic Programs. In “Proc. of the Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR'96)”, Cambridge, MA, USA, Morgan Kaufmann, pp. 529–540.

    Google Scholar 

  5. M. Cadoli and M. Schaerf (1993), A Survey of Complexity Results for Non-monotonic Logics, Journal of Logic Programming, Vol. 17, pp. 127–160.

    Article  MATH  MathSciNet  Google Scholar 

  6. Chandra, A., Harel, D. (1982), Structure and Complexity of Relational Queries. Journal of Computer and System Sciences, 25:99–128.

    Article  MATH  Google Scholar 

  7. Eiter, T., Gottlob, G. and Mannila, H. (1994), Adding Disjunction to Datalog, Proc. ACM PODS-94, pp. 267–278.

    Google Scholar 

  8. T. Eiter and G. Gottlob and H. Mannila (1997), Disjunctive Datalog, ACM Transactions on Database Systems, 22(3):364–418.

    Article  Google Scholar 

  9. Fagin R. (1974), Generalized First-Order Spectra and Polynomial-Time Recognizable Sets, Complexity of Computation, SIAM-AMS Proc, Vol. 7, pp. 43–73.

    MathSciNet  Google Scholar 

  10. Gelfond, M., Lifschitz, V. (1988), The Stable Model Semantics for Logic Programming, in Proc. of Fifth Conf. on Logic Programming, pp. 1070–1080, MIT Press.

    Google Scholar 

  11. Gelfond, M. and Lifschitz, V. (1991), Classical Negation in Logic Programs and Disjunctive Databases, New Generation Computing, 9, 365–385.

    MATH  Google Scholar 

  12. Gelfond, M. and Son, T.C., Reasoning with Prioritized Defaults, Proc. of the Workshop Logic Programming and Knowledge Representation — LPKR'97, Port Jefferson, New York, October 1997.

    Google Scholar 

  13. Gottlob, G., Complexity Results for Nonmonotonic Logics, Journal of Logic and Computation, Vol. 2, N. 3, pp. 397–425, 1992.

    MATH  MathSciNet  Google Scholar 

  14. Greco, S.(1990), Binding Propagation in Disjunctive Databases, Proc. Int. Conf. on Very Large Data Bases, New York City.

    Google Scholar 

  15. Herre H., and Wagner G. (1997), Stable Models Are Generated by a Stabel Chain, Journal of Logic Programming, 30(2): 165–177.

    Article  MATH  MathSciNet  Google Scholar 

  16. Leone, N., Rullo, P., Scarcello, F. (1995) Declarative and Fixpoint Characterizations of Disjunctive Stable Models, in “Proceedings of International Logic Programming Symposium (ILPS'95)”, Portland, Oregon, pp. 399–413, MIT Press.

    Google Scholar 

  17. Leone, N., Rullo, P., Scarcello, F. (1997) Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics and Computation, Information and Computation, Academic Press, Vol. 135, No. 2, June 15, 1997, pp. 69–112.

    Google Scholar 

  18. Marek, W., Truszczyński, M., Autoepistemic Logic, Journal of the ACM, 38, 3, 1991, pp. 518–619.

    Article  Google Scholar 

  19. Minker, J. (1982), On Indefinite Data Bases and the Closed World Assumption, in “Proc. of the 6th Conference on Automated Deduction (CADE-82),” pp. 292–308.

    Google Scholar 

  20. L. Pereira, J. Alferes, and J. Aparicio (1992), Well founded semantics for logic programs with explicit negation. In “Proc. of European Conference on AI”.

    Google Scholar 

  21. Przymusinski, T. (1988), On the Declarative Semantics of Deductive Databases and Logic Programming, in “Foundations of deductive databases and logic programming,” Minker, J. ed., ch. 5, pp.193–216, Morgan Kaufman, Washington, D.C.

    Google Scholar 

  22. Przymusinski, T. (1991), Stable Semantics for Disjunctive Programs, New Generation Computing, 9, 401–424.

    Article  MATH  Google Scholar 

  23. D. Saccà. The Expressive Powers of Stable Models for Bound and Unbound DATALOG Queries. Journal of Computer and System Sciences, Vol. 54, No. 3, June 1997, pp. 441–464.

    Article  MATH  MathSciNet  Google Scholar 

  24. Schlipf, J.S., The Expressive Powers of Logic Programming Semantics, Proc. ACM Symposium on Principles of Database Systems 1990, pp. 196–204.

    Google Scholar 

  25. Stockmeyer, L.J. (1977), The Polynomial-Time Hierarchy. Theoretical Computer Science, 3:1–22.

    Article  MATH  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  27. Vardi, M. (1982), Complexity of relational query languages, in “Proceedings 14th ACM STOC,” pp. 137–146.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DEIS, Università della Calabria, I-87030, Rende, Italy

    Sergio Greco

  2. Institut für Informationssysteme, Technische UniversitÄt Wien, Paniglgasse 16, A-1040, Wien, Austria

    Nicola Leone

  3. ISI-CNR c/o DEIS, Università della Calabria, 1-87030, Rende, Italy

    Francesco Scarcello

Authors
  1. Sergio Greco
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nicola Leone
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Francesco Scarcello
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jürgen Dix Luís Moniz Pereira Teodor C. Przymusinski

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Greco, S., Leone, N., Scarcello, F. (1998). Datalog with nested rules. In: Dix, J., Pereira, L.M., Przymusinski, T.C. (eds) Logic Programming and Knowledge Representation. LPKR 1997. Lecture Notes in Computer Science, vol 1471. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054789

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64958-8

  • Online ISBN: 978-3-540-49872-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation