Skip to main content

Datalog: A Perspective and the Potential

  • Conference paper
Datalog in Academia and Industry (Datalog 2.0 2012)

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 7494))

Included in the following conference series:

Abstract

Our main goal is to put Datalog into a proper logic perspective. It may be too early to put Datalog into a proper perspective from the point of view of applications; nevertheless we discuss why Datalog pops up so often in applications.

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

Access this chapter

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 49.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. Abiteboul, S., Vianu, V.: Datalog Extensions for Database Queries and Updates. J. of Computer and System Sciences 43, 62–124 (1991)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ajtai, M., Gurevich, Y.: Datalog vs First-Order Logic. J. of Computer and System Sciences 49(3), 562–588 (1994)

    Article  MathSciNet  MATH  Google Scholar 

  3. Alvaro, P., Marczak, W., Conway, N., Hellerstein, J.M., Maier, D., Sears, R.C.: Dedalus: Datalog in Time and Space. EECS Dept, University of California, Berkeley Technical Report No. UCB/EECS-2009-173, December 16 (2009)

    Google Scholar 

  4. Atserias, A., Dawar, A., Kolaitis, P.: On Preservation under Homomorphisms and Unions of Conjunctive Queries. JACM 53(2), 208–237 (2006)

    Article  MathSciNet  Google Scholar 

  5. Bjørner, N., de Caso, G., Gurevich, Y.: From Primal Infon Logic with Individual Variables to Datalog. In: Erdem, E., Lee, J., Lierler, Y., Pearce, D. (eds.) Correct Reasoning. LNCS, vol. 7265, pp. 72–86. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  6. Blass, A., Gurevich, Y.: Existential Fixed-Point Logic. In: Börger, E. (ed.) Computation Theory and Logic. LNCS, vol. 270, pp. 20–36. Springer, Heidelberg (1987)

    Chapter  Google Scholar 

  7. Blass, A., Gurevich, Y.: The Underlying Logic of Hoare Logic. Bull. EATCS 70, 82–110 (2000); also in Current Trends in Theoretical Computer Science, pp. 409–436. World Scientific (2001)

    Google Scholar 

  8. Blass, A., Gurevich, Y.: Two Forms of One Useful Logic: Existential Fixed Point Logic and Liberal Datalog. Bull. EATCS 95, 164–182 (2008)

    MathSciNet  MATH  Google Scholar 

  9. Blass, A., Gurevich, Y.: One Useful Logic That Defines Its Own Truth. In: Ochmański, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol. 5162, pp. 1–15. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  10. Blass, A., Gurevich, Y.: Hilbertian Deductive Systems, Infon Logic, and Datalog. Microsoft Research Technical Report MSR-TR-2011-81 (June 2011); to appear in Postproceeding from FCT 2011 in Information and Computation

    Google Scholar 

  11. Cook, S.A.: Soundness and Completeness of an Axiom System for Program Verification. SIAM J. Computing 7, 70–90 (1978)

    Article  MATH  Google Scholar 

  12. Cotrini, C., Gurevich, Y.: Revisiting Primal Infon Logic (in preparation)

    Google Scholar 

  13. Dantzin, E., Eiter, T., Gottlob, G., Voronkov, A.: Complexity and Expressive Power of Logic Programming. ACM Computing Sureveys 33(3), 374–425 (2001)

    Article  Google Scholar 

  14. Gurevich, Y.: Toward Logic Tailored for Computational Complexity. Springer Lecture Notes in Math, vol. 1104, pp. 175–216 (1984)

    Google Scholar 

  15. Gurevich, Y.: Two Notes on Propositional Primal Logic. Microsoft Research Tech. Report MSR-TR-2011-70 (May 2011)

    Google Scholar 

  16. Gurevich, Y., Neeman, I.: DKAL: Distributed-Knowledge Authorization Language. In: 21st IEEE Computer Security Foundations Symposium (CSF 2008), pp. 149–162 (2008)

    Google Scholar 

  17. Gurevich, Y., Neeman, I.: DKAL 2 — A Simplified and Improved Authorization Language, Microsoft Research Tech. Report MSR-TR-2009-11

    Google Scholar 

  18. Gurevich, Y., Shelah, S.: Fixed-Point Extensions of First-Order Logic. Annals of Pure and Applied Logic 32, 265–280 (1986)

    Article  MathSciNet  MATH  Google Scholar 

  19. Li, N., Mitchell, J.C.: DATALOG with Constraints: A Foundation for Trust Management Languages. In: Dahl, V., Wadler, P. (eds.) PADL 2003. LNCS, vol. 2562, pp. 58–73. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  20. Maltsev, A.I.: Model Correspondences. Izv. Akad. Nauk SSSR. Ser. Mat. 23, 313–336 (1959) (Russian)

    Google Scholar 

  21. Rossman, B.: Homomorphism Preservation Theorems. JACM 55(3), Article No. 15 (2008)

    Google Scholar 

  22. Ullman, J.D.: Principles of Database and Knowledge-Base Systems. The New Technologies, vol. II. W. H. Freeman & Co., New York (1990)

    Google Scholar 

  23. Wikipedia, Datalog, http://en.wikipedia.org/wiki/Datalog (viewed on June 14, 2012)

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gurevich, Y. (2012). Datalog: A Perspective and the Potential. In: Barceló, P., Pichler, R. (eds) Datalog in Academia and Industry. Datalog 2.0 2012. Lecture Notes in Computer Science, vol 7494. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-32925-8_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-32925-8_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-32924-1

  • Online ISBN: 978-3-642-32925-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics