Skip to main content
SpringerLink
Log in

Query answering in nondeterministic, nonmonotonic logic databases

  • Conference paper
  • First Online:
Flexible Query Answering Systems (FQAS 1998)

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

Included in the following conference series:

Abstract

We consider in this paper an extension of Datalog with mechanisms for temporal, non monotonic and non deterministic reasoning, which we refer to as Datalog++. We show, by means of examples, its flexibility in expressing queries of increasing difficulty, up to aggregates and data cube. Also, we show how iterated fixpoint and stable model semantics can be combined to the purpose of clarifying the semantics of Datalog++ programs, and supporting their efficient execution. On this basis, the design of appropriate optimization techniques for Datalog++ is also briefly discussed.

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. K. R. Apt, H. Blair, and A. Walker. Towards a theory of declarative knowledge. In J. Minker, editor, Proc. Workshop on Found of Deductive Databases and Logic Programming, pages 89–148. Morgan Kaufman, 1988.

    Google Scholar 

  2. N. Arvi, K. Ong, S. Tsur, and C. Zaniolo. LDL++: A Second Generation Deductive Databases Systems. Technical report, MCC Corporation, 1993.

    Google Scholar 

  3. F. Bonchi. Verification of Datalog++ programs (in Italian). Master's thesis, Department of Computer Science University of Pisa, 1998.

    Google Scholar 

  4. A. Brogi, V. S. Subrahmanian, and C. Zaniolo. The Logic of Totally and Partially Ordered Plans: a Deductive Database Approach. Annals of Mathematics in Artificial Intelligence, 19:59–96, 1997.

    Article  MathSciNet  Google Scholar 

  5. J. Chomicki. Temporal deductive databases. In A. Tansel, J. Clifford, S. Gadia, S. Jajodia, A. Segev, and R. Snodgrass, editors, Temporal Databases: Theory, Design and Implementation, pages 294–320. Benjamin Cummings, 1993.

    Google Scholar 

  6. M Gelfond and V. Lifchitz. The Stable Model Semantics for logic programming. In Proc. of the 5th Int. Conf. on Logic Programming, pages 1070–1080, 1988.

    Google Scholar 

  7. F. Giannotti, S. Greco, D. Saccà, and C. Zaniolo. Programming with non Determinism in Deductive Databases. Annals of Mathematics in Artificial Intelligence, 19:97–125, 1997.

    Article  MATH  Google Scholar 

  8. F. Giannotti, G. Manco, and D. Pedreschi. A Deductive Data Model for Representing and Querying Semistructured Data. In Proc. 5th Int. Conf. on Deductive and Object-Oriented Databases (DOOD97), December 1997.

    Google Scholar 

  9. F. Giannotti, D. Pedreschi, D. Saccà, and C. Zaniolo. Non-Determinism in Deductive Databases. In Proc. 2nd Int. Conf. on Deductive and Object-Oriented Databases (D00D91), volume 566 of Lecture Notes in Computer Science, pages 129–146, 1991.

    Google Scholar 

  10. F. Giannotti, D. Pedreschi, and C. Zaniolo. Semantics and Expressive Power of Non Deterministic Constructs for Deductive Databases. Technical Report C96-04, The CNUCE Institute, 1996. Submitted.

    Google Scholar 

  11. D. Kemp, K. Ramamohanarao, and P. Stuckey. ELS programs and the efficient evaluation of non-stratified programs by transformation to ELS. In Proc. 4th Int. Conf. on Deductive and Object-Oriented Databases (DOOD95), pages 91–108, 1995.

    Google Scholar 

  12. R. Krishnamurthy and S. Naqvi. Non-deterministic Choice in Datalog. In Proc. 3rd Int. Conf. on Data and Knowledge Bases, pages 416–424, 1988.

    Google Scholar 

  13. B. Lüdascher, U. Hamann, and G. Lausen. A logical framework for active rules. In Proc. 7th COMAD Int. Conf. on Management of Data. Tata McGraw-Hill, 1995.

    Google Scholar 

  14. M. Nanni. Nondeterminism and XY-Stratification in Deductive Databases (in Italian). Master's thesis, Department of Computer Science University of Pisa, 1997.

    Google Scholar 

  15. S. Naqvi and S. Tsur. A Logic Language for Data and Knowledge Bases. Computer Science Press, 1989.

    Google Scholar 

  16. T. C. Przymusinski. Every logic program has a natural stratification and an iterated fix point model. In Proc. 8th ACM PODS Symposium on Principles of Database Systems, pages 11–21, 1989.

    Google Scholar 

  17. K. A. Ross. Modular Stratification and Magic Sets for Datalog Program with Negation. Journal of ACM, 41(6):1216–1266, November 1994.

    Article  MATH  Google Scholar 

  18. D. Saccà and C. Zaniolo. Stable Models and Non-determinism in Logic Programs with Negation. In Proceedings of the ACM Symposium on Principles of Database Systems, pages 205–217, 1990.

    Google Scholar 

  19. C. Zaniolo. Active Database Rules with Transaction Conscious Stable Model Semantics. In Proc. 4th Int. Conf. on Deductive and Object-Oriented Databases (DOOD95), volume 1013 of Lecture Notes in Computer Science, pages 55–72, 1995.

    Google Scholar 

  20. C. Zaniolo, N. Arni, and K. Ong. Negation and Aggregates in Recursive Rules: The LDL++ Approach. In Proc. 3rd Int. Conf. on Deductive and Object-Oriented Databases (DOOD93), volume 760 of Lecture Notes in Computer Science, 1993.

    Google Scholar 

  21. C. Zaniolo, S. Ceri, C. Faloutsos, R.T Snodgrass, V.S. Subrahmanian, and R. Zicari. Advanced Database Systems. Morgan Kaufman, 1997.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CNUCE Institute of CNR, Via S. Maria 36, 56125, Pisa, Italy

    Fosca Giannotti & Giuseppe Manco

  2. Dipartimento di Informatica, Università di Pisa, C.so Italia 40, 56125, Pisa, Italy

    Mirco Nanni & Dino Pedreschi

Authors
  1. Fosca Giannotti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Giuseppe Manco
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mirco Nanni
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Dino Pedreschi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Troels Andreasen Henning Christiansen Henrik Legind Larsen

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Giannotti, F., Manco, G., Nanni, M., Pedreschi, D. (1998). Query answering in nondeterministic, nonmonotonic logic databases. In: Andreasen, T., Christiansen, H., Larsen, H.L. (eds) Flexible Query Answering Systems. FQAS 1998. Lecture Notes in Computer Science, vol 1495. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056000

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation