Skip to main content

The deductive database system LOLA

  • System-Descriptions
  • Conference paper
  • First Online:
Book cover Logic Programming And Nonmonotonic Reasoning (LPNMR 1997)

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

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Beeri and R. Ramakrishnan. On the power of magic. Journal of Logic Programming, 10:255–299, 1991.

    Google Scholar 

  2. B. Freitag, H. Schütz, and G. Specht. LOLA — a logic language for deductive databases and its implementation. In Proc. 2nd International Symposium on Database Systems for Advanced Applications (DASFAA '91), Tokyo, Japan, April 2–4, 1991, pages 216–225, 1991.

    Google Scholar 

  3. B. Freitag, B. Steffen, T. Margaria, and U. Zukowski. An approach to intelligent software library management. In Proc. 4th International Conference on Database Systems for Advanced Applications (DASFAA '95), National University of Singapore, Singapore, pages 71–78, Apr. 1995.

    Google Scholar 

  4. D. B. Kemp, D. Srivastava, and P. J. Stuckey. Bottom-up evaluation and query optimization of well-founded models. Theoretical Computer Science, 146:145–184, 1995.

    Google Scholar 

  5. A. Lefebvre. Towards an efficient evaluation of recursive aggregates in deductive databases. New Generation Computing, 12(2):131–160, 1994.

    Google Scholar 

  6. R. Ramakrishnan. Magic templates: A spellbinding approach to logic programs. Journal of Logic Programming, 11(3/4):189–216, October/November 1991.

    Google Scholar 

  7. K. A. Ross. Modular stratification and magic sets for datalog programs with negation. Journal of the ACM, 41(6):1216–1266, November 1994.

    Google Scholar 

  8. K. A. Ross. A syntactic stratification condition using constraints. In Proc. International Logic Programming Symposium, pages 76–90, Ithaca, New York, 1994.

    Google Scholar 

  9. G. Specht and B. Freitag. AMOS: A natural language parser implemented as a deductive database in LOLA. In R. Ramakrishnan, editor, Applications of Logic Databases, chapter 9, pages 197–215. Kluwer Academic Publishers, Boston, 1995.

    Google Scholar 

  10. G. Specht and S. Seeberger. Montague grammars as deductive databases. In Deductive and Object-Oriented Databases — Proc. 4th International Conference DOOD'95, pages 363–377, Singapore, 1995.

    Google Scholar 

  11. A. Van Gelder, K. A. Ross, and J. S. Schlipf. The well-founded semantics for general logic programs. Journal of the Association for Computing Machinary (JACM), 38:620–650, 1991.

    Google Scholar 

  12. U. Zukowski and B. Freitag. Adding flexibility to query evaluation for modularly stratified databases. In Proc. of the 1996 Joint International Conference and Symposium on Logic Programming (JICSLP'96). September 2–6, 1996, Bonn, Germany, pages 304–319. MIT Press, 1996.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Jürgen Dix Ulrich Furbach Anil Nerode

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zukowski, U., Freitag, B. (1997). The deductive database system LOLA. In: Dix, J., Furbach, U., Nerode, A. (eds) Logic Programming And Nonmonotonic Reasoning. LPNMR 1997. Lecture Notes in Computer Science, vol 1265. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63255-7_28

Download citation

  • DOI: https://doi.org/10.1007/3-540-63255-7_28

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-69249-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics