Skip to main content

Querying disjunctive databases through nonmonotonic logics

Contributed Papers

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

Abstract

In this paper we study the expressive power of major nonmonotonic formalisms — among them circumscription, default logic, and autoepistemic logic — used as query languages over disjunctive databases. For this aim, we define the semantics of query expressions formulated in different nonmonotonic logics. The expressive power of the languages that we consider has been explored in the context of relational databases. Here, we extend this study to disjunctive databases; as a result, we obtain a finer-grained characterization of the expressive capabilities of those languages and interesting fragments thereof.

In particular, we show that there exist queries that cannot be expressed by any preference-based semantics (including the minimal model semantics and the various forms of circumscription), but which can be expressed in default and autoepistemic logic. Secondly, we show that default logic, autoepistemic logic and some of their fragments express the same class of Boolean queries, which turns out to be a strict subclass of the p2 -recognizable Boolean queries. Then we prove that under the assumption that the database consists of clauses whose length is bound by some constant, default logic and autoepistemic logic express all of the p2 -recognizable Boolean queries, while preference-based logics do not.

Keywords

  • Relational Database
  • Query Language
  • Expressive Power
  • Default Theory
  • Default Logic

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • DOI: 10.1007/3-540-58907-4_7
  • Chapter length: 14 pages
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
eBook
USD   99.00
Price excludes VAT (USA)
  • ISBN: 978-3-540-49136-1
  • Instant PDF download
  • Readable on all devices
  • Own it forever
  • Exclusive offer for individuals only
  • Tax calculation will be finalised during checkout
Softcover Book
USD   129.00
Price excludes VAT (USA)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Abiteboul, S., Kanellakis, P., Grahne, G.: On the Representation and Querying of Sets of Possible Worlds. Theoretical Computer Science 78 (1991) 159–187

    Google Scholar 

  2. Abiteboul, S., Vianu, V.: Expressive Power of Query Languages. In Ullman, J. (ed.) Theoretical Studies in Computer Science. Academic Press, 1992

    Google Scholar 

  3. Bonatti, P. A., Eiter, T.: Querying Disjunctive Databases Through Nonmonotonic Logics. Technical Report CD-TR 94/70, CD-Laboratory for Expert Systems, TU Vienna, Austria, 1994. Forthcoming. Preliminary version available from the authors.

    Google Scholar 

  4. Bonatti, P. A.: Autoepistemic Logics as a Unifying Framework for the Semantics of Logic Programs. Journal of Logic Programming (to appear). Preliminary version in Apt, K. (ed.) Proc. of the Joint International Conference and Symposium on Logic Programming, MIT Press, 1992

    Google Scholar 

  5. Cadoli, M., Eiter, T., Gottlob, G.: Using Default Logic as a Query Language. In Proc. Fourth International Conference on Principles of Knowledge Representation and Reasoning (KR-94), 99–108, 1994

    Google Scholar 

  6. Chandra, A., Harel, D.: Horn Clause Queries and Generalizations. Journal of Logic Programming 2 (1985) 1–15

    Google Scholar 

  7. Chandra A. K.: Theory of Database Queries. In Proc. PODS-88, 1988

    Google Scholar 

  8. Eiter, T., Gottlob, G., Mannila, H.: Adding Disjunction to Datalog. In Proc. Thirteenth ACM SIGACT SIGMOD-SIGART Symposium on Principles of Database Systems (PODS-94), 267–278, May 1994

    Google Scholar 

  9. Etherington, D. W.: Reasoning with Incomplete Information. Morgan Kaufmann Publishers, Inc., Los Altos, 1988

    Google Scholar 

  10. Fernández, J., Minker, J.: Semantics of Disjunctive Deductive Databases. In Proc. 4th Intl. Conference on Database Theory (ICDT-92), LNCS 646, 21–50, Springer-Verlag, 1992

    Google Scholar 

  11. Gottlob G.: Complexity Results for Nonmonotonic Logics. Journal of Logic and Computation 2 (1992) 397–425

    Google Scholar 

  12. Grahne G.: Updates and Counterfactuals. In Proceedings Second International Conference on Principles of Knowledge Representation and Reasoning (KR-91), 269–276, 1991

    Google Scholar 

  13. Gurevich Y.: Logic and the Challenge of Computer Science. In E. Börger, editor, Trends in Theoretical Computer Science, Chapter 1. Computer Science Press, 1988

    Google Scholar 

  14. Kanellakis, P.: Elements of Relational Database Theory. In J. van Leeuwen (ed.) Handbook of Theoretical Computer Science, Volume B, Chapter 17. Elsevier Science Publishers B.V. (North-Holland), 1990

    Google Scholar 

  15. Kolaitis, P., Vardi, M.: On the Expressive Power of Datalog: Tools and a Case Study. In Proceedings PODS-90, 61–71, 1990

    Google Scholar 

  16. Lobo, J., Minker, J., Rajasekar, A.: Foundations of Disjunctive Logic Programming. MIT Press, Cambridge, MA, 1992

    Google Scholar 

  17. Lukasiewicz, W.: Non-Monotonic Reasoning. Ellis Horwood Limited, Chichester, England, 1990

    Google Scholar 

  18. Marek, W., Truszczyński, M.: Autoepistemic Logic. Journal of the ACM 38 (1991) 588–619

    Google Scholar 

  19. Marek, W., Truszczyński, M.: Nonmonotonic Logics — Context-Dependent Reasoning. Springer-Verlag, 1993

    Google Scholar 

  20. Moore R.: Semantical Considerations on Nonmonotonic Logics. Artificial Intelligence 25 (1985) 75–94

    Google Scholar 

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

    Google Scholar 

  22. Przymusinski, T.: On the Declarative and Procedural Semantics of Stratified Deductive Databases. in Minker, J. (ed.) Foundations of Deductive Databases and Logic Programming, 193–216. Morgan Kaufman, 1988

    Google Scholar 

  23. Reiter, R.: A Logic for Default Reasoning. Artificial Intelligence 13 (1980) 81–132

    Google Scholar 

  24. Schlipf, J.: The Expressive Powers of Logic Programming Semantics. Technical Report CIS-TR-90-3, Computer Science Department, University of Cincinnati, 1990. Preliminary version in Proc. PODS-90, 196–204. To appear in the Journal of Computer and System Sciences

    Google Scholar 

  25. Vardi, M.: Complexity of relational query languages. In Proceedings 14th STOC, 137–146, 1982

    Google Scholar 

  26. Vardi, M.: Querying Logical Databases. Journal of Computer and System Sciences 32 (1986) 142–160

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bonatti, P.A., Eiter, T. (1995). Querying disjunctive databases through nonmonotonic logics. In: Gottlob, G., Vardi, M.Y. (eds) Database Theory — ICDT '95. ICDT 1995. Lecture Notes in Computer Science, vol 893. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58907-4_7

Download citation

  • DOI: https://doi.org/10.1007/3-540-58907-4_7

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58907-5

  • Online ISBN: 978-3-540-49136-1

  • eBook Packages: Springer Book Archive