Abstract
This paper gives an overview of the knowledge processing in the LILOG project. We describe the knowledge processing component as it has been realized within the first prototype and give some experimental results. The experiences gained with the first prototype motivated us to improve the knowledge processing for the second prototype. These modifications are presented in the second part of this paper.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Beierle, C., Dörre, J., Pletat, U., Schmitt, P. H., Studer, R. (1988): “The Knowledge Representation Language LLILOG”, LILOG-Report 41, IBM Germany, Stuttgart
Beierle, C., Hedtstück, U., Pletat, U., Siekmann, J. (1989): “An Order Sorted Predicate Logic With Closely Coupeled Taxonomic Information”, IWBS Report, IBM Germany, Stuttgart
Bollinger, T., Hedtstück, U., Rollinger, C.-R. (1988): “Reasoning in Text Understanding, Knowledge Processing in the LILOG-Prototype”. LILOG-Report 49, IBM Germany, Stuttgart
Brachman, R. J., Schmolze, J. G., (1985): “An Overview of the KL-ONE Knowledge Representation System”, Cognitive Science 9 (2), 171–216, 1985.
Cohn, A. G. (1987): “A More Expressive Formulation of Many Sorted Logic”, Journal of Automated Reasoning 3, 113–200.
Digricoli, V.J. (1979): “Resolution by Unification and Equality”. Proc. 4th Workshop on Automated Deduction, Texas
Kamp, H. (1981): “A Theory of Truth and Semantic Representation”, in: J. A. Groenendijk et al. (eds.): “Formal Methods in the Study of Natural Language”, Vol. 1, Amsterdam
Khenkhar, M.N. (1988): “Vorüberlegungen zur depiktionalen Repräsentation räumlichen Wissens”, LILOG-Report 19, IBM Germany, Stuttgart
Müller, B. (1989): “Ein Resolutionsskalkül für ordnungssortierte Prädikatenlogik mit Sortenliteralen”, Diplomarbeit, Institut für Informatik, Universität Stuttgart
Pletat, U., v. Luck, K. (1989): “Knowledge Representation in LILOG”, to appear in: Bläsius, K.-H., Hedtstück, U., Rollinger, C.-R. (eds.): “Sorts and Typs in Artifical Intelligence”, Lecture Notes in Computer Science, Springer Verlag, Heidelberg
Robinson, G., Wos L. (1969): “Paramodulation and TP in First Order Theories with Equality”, Machine Intelligence 4, 135–150
Schmidt-Schauss, M. (1988): “Computational Aspects of an Order-Sorted Logic with Term Declaration”, Dissertation, Universität Kaiserslautern
Siekmann, J. (1989): “Unification Theory”, Journal of Symbolic Computation, Vol. 7, Special Issue on Unification Theory
Stickel, M. E. (1985): “Automated Deduction by Theory Resolution”, Journal of Automated Reasoning 1(4), 1985, 333–355.
Wachsmuth, I. (1987): “On Structering Domain Specific Knowledge”, LILOG-Report 12, IBM Germany, Stuttgart
Walther, C. (1987): “A Many-Sorted Calculus Based on Resolution and Paramodulation”, in Research Notes in Artificial Intelligence, Pitman, London, and Morgan Kaufmann, Los Altos, California
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bollinger, T., Bläsius, KH., Hedtstück, U. (1990). Knowledge processing in the LILOG project from the first to the second prototype. In: Studer, R. (eds) Natural Language and Logic. Lecture Notes in Computer Science, vol 459. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53082-7_15
Download citation
DOI: https://doi.org/10.1007/3-540-53082-7_15
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53082-4
Online ISBN: 978-3-540-46653-6
eBook Packages: Springer Book Archive