Skip to main content
SpringerLink
Log in

The LILOG inference engine

  • Chapter
  • First Online:
Text Understanding in LILOG

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

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. Beierle, C., Hedtstück, U., Pletat, U., and Siekmann, J. An order-sorted predicate logic with closely coupled taxonomic information. IWBS Report 86, IBM Deutschland, Stuttgart, 1989.

    Google Scholar 

  2. Bollinger, T. A model elimination calculus for generalized clauses. In Proceedings of the 12th International Joint Conference on Artificial Intelligence, Sydney, Australia, 1991. Morgan Kaufmann.

    Google Scholar 

  3. Chang, C.-L. and Lee, R.C.-T. Symbolic Logic and Mechanical Theorem Proving. Computer Science and Applied Mathematics Series. Academic Press, New York, 1973.

    Google Scholar 

  4. de Kleer, J. An assumption-based truth maintenance system. Artificial Intelligence, (28):127–162, 1986.

    Google Scholar 

  5. Doyle, J. A truth maintenance system. Artificial Intelligence, (12):231–272, 1979.

    Article  Google Scholar 

  6. Gehlen, E., Ley, M., Ludwig, T., Maier, A., and Walter, B. DB support for KB systems. In Text Understanding in LILOG: Integrating Computational Linguistics and Artificial Intelligence, Lecture Notes in Artificial Intelligence. Springer-Verlag, Berlin, Heidelberg, New York, this volume.

    Google Scholar 

  7. Goltz, H.J. Ein praktischer Algorithmus für die E-Unifikation. IWBS Report 166, IBM Deutschland, Stuttgart, 1991.

    Google Scholar 

  8. Habel, C. Processing of spatial expressions in LILOG. In Text Understanding in LILOG: Integrating Computational Linguistics and Artificial Intelligence, Lecture Notes in Artificial Intelligence. Springer-Verlag, Berlin, Heidelberg, New York, this volume.

    Google Scholar 

  9. Hedtstück, U. and Schmitt, P. H. A calculus for order-sorted predicate logic with sort literals. In Bläsius, K.H., Hedtück, U., and Rollinger, C.-R., editors, Sorts and Types for Artificial Intelligence, Lecture Notes in Computer Science. Springer-Verlag, Berlin, 1990.

    Google Scholar 

  10. Horty, J.F., Thomason, R.H., and Touretzky, D.S. A skeptical theory of inheritance in nonmontonic semantic networks. CMU-CS-87-175, Carnegie Mellon University, 1987.

    Google Scholar 

  11. Khenkhar, M. N. DEPIC-2D: Eine Komponente zur depiktionalen Repräsentation und Verarbeitung räumlichen Wissens. In Metzing, D., editor, GWAI-89. 13th German Workshop on Artificial Intelligence, pages 318–322. Springer-Verlag, Berlin, 1989.

    Google Scholar 

  12. Letz, R., Schumann, J., Bayerl, S., and Bibel, W. SETHEO: A high-performance theorem prover. Journal of Automated Reasoning, to appear 1991.

    Google Scholar 

  13. Lorenz, S. Nichtmonotones Schließen mit ordungssortierten Defaults. Master's thesis, University of Karlsruhe, 1989.

    Google Scholar 

  14. Loveland, D. A simplified format for the model elimination theorem-proving procedure. Journal of the Association for Computing Machinery, 16(3):349–363, 1969. Also published in [Siekmann and Wrightson 1983 pages 233–248].

    Google Scholar 

  15. Loveland, D. Automated Theorem Proving: A Logical Basis, volume 6 of Fundamental Studies in Computer Science. North-Holland, New York, 1978.

    Google Scholar 

  16. Ludwig, Th. A brief overview of LILOG-DB. In Liu, M., editor, Proceedings of the 1990 Conference on Data Engineering. Los Angeles, 1990.

    Google Scholar 

  17. Nilsson, N. J. Principles of Artificial Intelligence. Tioga, Palo Alto, CA, 1980.

    Google Scholar 

  18. Pletat, U. The knowledge representation language LLILOG. In Text Understanding in LILOG: Integrating Computational Linguistics and Artificial Intelligence, Lecture Notes in Artificial Intelligence. Springer-Verlag, Berlin, Heidelberg, New York, this volume.

    Google Scholar 

  19. Pletat, U. Inconsistency checking of LLILOG sort expressions. IWBS Report, IBM Deutschland, Stuttgart, to appear 1991.

    Google Scholar 

  20. Siekmann, Jörg and Wrightson, Graham, editors. Automation of Reasoning 2. Springer-Verlag, Berlin, 1983.

    Google Scholar 

  21. Stickel, M. E. A Prolog technology theorem prover. New Generation Computing, 2:371–383, 1984.

    Google Scholar 

  22. Warren, D. Compiling predicate logic programs. DAI research report, University of Edinburgh, 1977.

    Google Scholar 

Download references

Authors
  1. Toni Bollinger
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sven Lorenz
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Udo Pletat
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Otthein Herzog Claus-Rainer Rollinger

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Bollinger, T., Lorenz, S., Pletat, U. (1991). The LILOG inference engine. In: Herzog, O., Rollinger, CR. (eds) Text Understanding in LILOG. Lecture Notes in Computer Science, vol 546. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54594-8_72

Download citation

  • DOI: https://doi.org/10.1007/3-540-54594-8_72

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54594-1

  • Online ISBN: 978-3-540-38493-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation