LILOG-DB: Database Support for Knowledge-Based Systems | SpringerLink
Skip to main content

LILOG-DB: Database Support for Knowledge-Based Systems

  • Conference paper
Datenbanksysteme in Büro, Technik und Wissenschaft

Part of the book series: Informatik-Fachberichte ((INFORMATIK,volume 204))

Abstract

LILOG is an interdisciplinary project for developing an experimental system performing the acquisition of knowledge by analyzing documents written in a natural language (German). Part of the experimental system is LILOG-DB, a backend database system, that supports a variety of knowledge structures as well as inferential processing. An overview of the architecture of LILOG-DB is given, focussing on the Feature Term based data model and the corresponding Feature Term Algebra (FTA). It is demonstrated how queries stated in a language based on first-order feature-logic are translated to expressions of the FTA. Finally, it is shown how LILOG-DB supports the inferential processing in the other parts of the LILOG experimental system by sophisticated rule management.

This research was supported by IBM Deutschland GmbH as part of the LILOG project.

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

Access this chapter

Subscribe and save

Springer+ Basic
¥17,985 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
JPY 3498
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
JPY 5879
Price includes VAT (Japan)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
JPY 7349
Price includes VAT (Japan)
  • 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.

Similar content being viewed by others

Literature

  1. H. Ait-Kaci: An Algebraic Semantics Approach to Effective Resolution of Type Equations. Theoretical Computer Science 45, 1986, 293–351.

    Article  MATH  MathSciNet  Google Scholar 

  2. H. Ait-Kaci, R. Nasr: LOGIN: A Logic Programming Language with Built-in Inheritance. JLP 1986, 3, 185–215.

    Article  Google Scholar 

  3. C. Beierle, J.Dörre, U.Pletat, C. Rollinger, P.H. Schmitt, R. Studer: The Knowledge Representation Language Llilog. LILOG Report 41, 1988.

    Google Scholar 

  4. C. Beierle, U. Pletat, H. Uszkoreit: An Algebraic Characterization of STUF. LILOG Report 40, IBM Stuttgart, 1988.

    Google Scholar 

  5. R.J. Brachman, H.J. Levesque: Tales from the Far Side of KRYPTON. In: Expert Database Systems. Ed. L. Kerschberg, Expert Database Systems, First Int. Conf., Benjamin/Cummings, 1987, 3–43.

    Google Scholar 

  6. M.J. Carey, D.J. DeWitt, D. Frank, G. Graefe, M. Muralikrishna, J.E. Richardson, E.J. Shekita: The Architecture of the EXODUS Extensible DBMS. Int. Workshop on Object-Oriented Database Systems, 1986, IEEE Computer Society Press, 52–65.

    Google Scholar 

  7. M.J.Carey, D.J. DeWitt, J.E. Richardson, E.J. Shekita: Object and File Management in the EXODUS Extensible Database System. Proc. of the 12th VLDB Conf., Kyoto 1986, 91–100.

    Google Scholar 

  8. C.L. Chang, J.R. Slagle: Using Rewriting Rules for Connection Graphs to Prove Theorems. Artificial Intelligence 12, 1979, 159–180.

    Article  MATH  MathSciNet  Google Scholar 

  9. C. Faloutsos, S. Christodoulakis: Describing and Performance Analysis of Signature File Methods for Office Filing. ACM Transactions on Office Information Systems, Vol. 5, No. 3, July 1987, 237–257.

    Article  Google Scholar 

  10. C. Faloutsos: Access Methods for Text. Computing Surveys, Vol. 17, No. 1, March 1985, 49–74.

    Article  Google Scholar 

  11. J. Freitag, Th. Bode: Ein allgemeiner Speicherobjektmanager als Implementierungsbasis für komplexe Objekttypen in einem Objektmanagementsystem. BTW’89, Zürich, Informatik Fachberichte.

    Google Scholar 

  12. M. Huber and I. Varsek: Extended Prolog for Order-Sorted Resolution. Symposium on Logic Programming, San Francisco 1987,34–43.

    Google Scholar 

  13. R.T. Kasper, W.C. Rounds: A Logical Semantics for Feature Structures. Proceedings of the 24th Ann. Meeting of the Ass. for Computational Linguistics. Columbia University, New York 1986, 257–265.

    Google Scholar 

  14. R. Kowalski: A Proof Procedure Using Connection Graphs. JACM Vol. 22, No. 4, 1975, 572–595.

    Article  MATH  Google Scholar 

  15. A. Kent, R. Sachs-Davis, K. Ramamohanarao: A Superimposed Coding Scheme Based on Multiple Block Descriptor Files for Indexing Very Large Data Bases. Proc. of the 14th VLDB Conf., Los Angeles 1988, 351–359.

    Google Scholar 

  16. M. Ley: Ein Fact-Manager zur persistenten Speicherung variabel strukturierter komplexer Objekte. LILOG Report 60, IBM Stuttgart, Oktober 1988.

    Google Scholar 

  17. W. Litwin, D.B. Lomet: A New Method for Fast Data Searches with Keys. IEEE Software, March 1987, 16–24.

    Google Scholar 

  18. Th. Ludwig: EFTA: An Algebra for Deductive Retrieval of Feature-Terms. LILOG Report 58, IBM Stuttgart, October 1988.

    Google Scholar 

  19. Th. Ludwig: Algebraical Optimization of FTA-Expressions. LILOG Report 59, IBM Stuttgart, October 1988.

    Google Scholar 

  20. D.P. McKay, S.S. Shapiro: Using Active Connection Graphs for Reasoning with Recursive Rules. IJCAI 1981, 368–374.

    Google Scholar 

  21. G. Montini: Efficiency Considerations on Built-in Taxonomic Reasoning in Prolog. IJCAI, Mailand 1987, 68–75.

    Google Scholar 

  22. C.S. Roberts: Partial-Match Retrieval via the Method of Superimposed Codes. Proceedings of the IEEE, Vol. 67, No. 12, December 1979, 1624–1642.

    Article  Google Scholar 

  23. R. Sachs-Davis, K. Ramamohanarao: A Two Level Superimposed Coding Scheme for Partial Match Retrieval. Information Systems, Vol. 8, No. 4, 1983, 273–280.

    Article  Google Scholar 

  24. H.-J. Schek, P. Pistor: Data Structures for an Integrated Data Base Management and Information Retrieval System. Proc. of the 8th VLDB Conf., Mexico City 1982, 197–207.

    Google Scholar 

  25. G. Smolka: A Feature Logic with Subsorts. LILOG Report 33, 1988.

    Google Scholar 

  26. J.D. Ullman: Implementation of Logical Query Languages for Databases.ACM Transactions on Database Systems, Vol. 10, No. 3, September 1985, 289–321.

    Article  MATH  Google Scholar 

  27. H. Uszkoreit: From Feature Bundles to Abstract Data Types: New Directions in the Representation and Processing of Linguistic Knowledge.In: Natural Language at the Computer. Proc. of the Scientific Symposium on Syntax and Semantik for Text Processing and Man-Machine-Communication. Ed. Blaser, Heidelberg, February 1988, 31–64.

    Google Scholar 

  28. A. v. Gelder: A Message Passing Framework for Logical Query Evaluation. Stanford University, Report No. STAN-CS-85–1088.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ludwig, T., Walter, B., Ley, M., Maier, A., Gehlen, E. (1989). LILOG-DB: Database Support for Knowledge-Based Systems. In: Härder, T. (eds) Datenbanksysteme in Büro, Technik und Wissenschaft. Informatik-Fachberichte, vol 204. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-74571-3_15

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-74571-3_15

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-50894-6

  • Online ISBN: 978-3-642-74571-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics