Skip to main content
SpringerLink
Log in

On Verification in Logic Database Languages

  • Conference paper
  • First Online:
Computational Logic — CL 2000 (CL 2000)

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

Included in the following conference series:

  • 589 Accesses

Abstract

We consider in this paper an extension of Datalog with mechanisms for non-monotonic and non-deterministic reasoning and a simple form of temporal reasoning, which we refer to as Datalog++. First, we show how with this logic database language is possible to express problems in heterogeneous domains, such as operation research and concurrent programming. Second, we provide a methodology for the verification of Datalog++ programs, based on the declarative semantics, which is able to handle both atemporal and temporal properties.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. K. R. Apt. Program verification and Prolog. In E. Borger, editor, Specification and Validation methods for Programming languages and systems. Oxford University press, 1994.

    Google Scholar 

  2. N. Arni, 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. K.M. Chandy and J. Misra. Parrallel Program Design: A Foundation. Addison-Wesley, 1988.

    Google Scholar 

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

  7. P. Derensart. Proof methods of declarative properties of definite programs. Theoretical Computer Science, 118:99–166, 1993.

    Article  MathSciNet  Google Scholar 

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

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

  10. F. Giannotti, G. Manco, M. Nanni, D. Pedreschi, and F. Turini. Nondeterministic, nonmonotonic logic databases. To appear in IEEE Transaction on Knowledge and Data Engineering, 2000.

    Google Scholar 

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

  12. 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 (DOOD91), volume 566 of Lecture Notes in Computer Science, pages 129–146, 1991.

    Google Scholar 

  13. V. Marek and V.S. Subrahmanian. The relation between stable, supported, default and auto-epistemic semantics for general logic programs. Theoretical Computer Science, 103:365–386, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  14. A. Pnueli. The temporal logic of programs. In Proceedings of the 18 th. IEEE Symposium on Foundations of Computer Science, pages 44–57, 1977.

    Google Scholar 

  15. D. Saccà and C. Zaniolo. Stable Models and Non-determinism in Logic Programs with Negation. In Proc. of the ACM Symp. on Principles of Database Systems.

    Google Scholar 

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

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

  18. 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 - CNR, Via Alfieri 1, 56010, Ghezzano, Pisa, Italy

    Francesco Bonchi & Fosca Giannotti

  2. Department of Computer Science, University of Pisa, C.so Italia 40, Pisa, Italy

    Francesco Bonchi & Dino Pedreschi

Authors
  1. Francesco Bonchi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fosca Giannotti
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dino Pedreschi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. The Australian National University, Australia

    John Lloyd

  2. Simon Fraser University, Canada

    Veronica Dahl

  3. Universität Koblenz, Germany

    Ulrich Furbach

  4. The University of Birmingham, UK

    Manfred Kerber

  5. University of Manchester, UK

    Kung-Kiu Lau

  6. The Pennsylvania State University, USA

    Catuscia Palamidessi

  7. Universidade Nova de Lisboa, Portugal

    Luís Moniz Pereira

  8. The Hebrew University of Jerusalem, Israel

    Yehoshua Sagiv

  9. The University of Melbourne, Australia

    Peter J. Stuckey

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bonchi, F., Giannotti, F., Pedreschi, D. (2000). On Verification in Logic Database Languages. In: Lloyd, J., et al. Computational Logic — CL 2000. CL 2000. Lecture Notes in Computer Science(), vol 1861. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44957-4_64

Download citation

  • DOI: https://doi.org/10.1007/3-540-44957-4_64

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67797-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation