Abstract
This paper introduces the knowledge representation language L LILOG . The language is being developed in the framework of the LILOG project and serves for modelling the semantic background knowledge of the LILOG natural language understanding system. Moreover, it is also used as the target language for representing information extracted from German texts in a logical form. The aspects of L LILOG discussed here focus on the sort concept of L LILOG and its means for structuring knowledge bases. The sort concept of L LILOG integrates ideas from the KL-ONE family of languages and other feature term languages having their origin in the area of computational linguistics into the framework of an order-sorted predicate logic. The structuring concept introduced for L LILOG is a simple form of separating logical theories into modules.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
C. Beierle, J. Dörre, U. Pletat, C. Rollinger, P.H. Schmitt, R. Studer: The Knowledge Representation Language L LILOG. IBM Deutschland, Wissenschaftliches Zentrum, LILOG-Report Nr. 41, Stuttgart 1988
C. Beierle, U. Pletat, H. Uszkoreit: An Algebraic Characterization of STUF Proc. Symposium Computerlinguistik und ihre theoretischen Grundlagen, I.S. Batori, U. Hahn, M. Pinkal, W. Wahlster (eds), Informatik Fachberichte, Vol. 195, Springer-Verlag, Berlin 1988
C. Beierle, U. Hedtstück, U. Pletat, J. Siekmann: An Order Sorted Predicate Logic with Closely Coupled Taxonomic Information. To appear, 1989
G. Bouma, E. König, H. Uszkoreit: A flexible graph-unification formalism and its application to natural-language processing. IBM J. Res. Develop. 32 2, 1988, 170–184
R.J. Brachman, R.E. Fikes, H.J. Levesque: KRYPTON: Integrating Terminology and Assertion. Proc. of AAAI-83 1983 31–35
R.J. Brachman, J.G. Schmolze: An Overview of the KL-ONE Knowledge Representation System. Cognitive Science 9 (2) April 1985, 171–216
R.J. Brachman, V. Pigman, Gilbert, H.J. Levesque: An Essential Hybrid Reasoning System. Proc. IJCAI-85, 1985, 532–539
A. G. Cohn: A More Expressive Formulation of Many Sorted Logic. Journal of Automated Reasoning, 3:113–200, 1987
H. Ehrig, B. Mahr: Foundations of Algebraic Specifications I. Springer-Verlag, Berlin 1985
J. A. Goguen, R. M Burstall: Institutions: Abstract Model Theory for Computer Science. SRI International Report 1985
J. A. Goguen, J. Meseguer: Order-Sorted Algebra I. SRI International Report 1987
G.G. Hendrix: Encoding Knowledge in Partitioned Networks. in: Associative Networks, Findler (ed.), Academic Press, 1979, 51–92
O. Herzog et al.: LILOG — Linguistische und logische Methoden für das maschinelle Verstehen des Deutschen. IBM Deutschland GmbH, LILOG-Report 1a, 1986
R. T. Kasper, W. C. Rounds: A Logicical Semantics for Feature Structures. Proc. 24th ACL Meeting, 257–265, Columbia University 1986
G. Link: The Logical Analysis of Plurals and Mass Terms. in: Bäuerle et al. (eds): Meaning, Use, and Interpretation of Language, de Gruyter Verlag, Berlin 1983, 302–323
K. v. Luck, B. Nebel, C. Peltason, A. Schmiedel The Anatomy of The BACK-System. TU Berlin, KIT-Report No. 41, Jan. 1987
K. v. Luck, Bernd Owsnicki-Klewe: Neuere KI-Formalismen zur Repräsentation von Wissen. in: Christaller (Hrsg.), Künstliche Intelligenz, Springer-Verlag, Berlin 1989, 157–187
A. Oberschelp: Untersuchungen zur mehrsortigen Quantorenlogik. Mathematische Annalen, 145:297–333, 1962
P.F. Patel-Schneider: Small can be Beautiful in Knowledge Representation. Proc. IEEE Workshop on Principles of Knowledge-Based Systems, 1984, 11–19
U. Pletat: Aspects of Consistency of Sophisticated Knowledge Representation Languages. Proc. IBM Symposium Natural Language and Logic, 1989. To appear in Lecture Notes in Artificial Intelligence, Springer-Verlage, Berlin.
M. Schmidt-Schauss: Subsumption in KL-ONE is Undecidable. Universität Kaiserslautern, SEKI-Report SR-88-14, 1988
S. Shieber: An Introduction to Unification-Based Approaches to Grammar. CSLI Lecture Notes 4, Stanford University 1986
G. Smolka: A Feature Logic with Subsorts. Wissenschaftliches Zentrum der IBM Deutschland, LILOG-Report 33, 1988
G.J. Sussman, D.V. McDermott: From PLANNER to CONNIVER. Proc. of Fall Joint Comp. Conf. 1972, 1171–1179
M. Vilain: The Restricted Language Architecture of a Hybrid Representation System. Proc. IJCAI-85, 1985, 547–551
I. Wachsmuth: Zur intelligenten Organisation von Wissensbeständen in künstlichen Systemen. Habilitationsschrift, Universität Osnabrück, 1988
C. Walther: A Many-Sorted Calculus Based on Resolution and Paramodulation. Research Notes in Artificial Intelligence, 1987
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pletat, U., von Luck, K. (1990). Knowledge representation in LILOG. In: Bläsius, K.H., Hedtstück, U., Rollinger, CR. (eds) Sorts and Types in Artificial Intelligence. Lecture Notes in Computer Science, vol 418. Springer, Berlin, Heidelberg . https://doi.org/10.1007/3-540-52337-6_22
Download citation
DOI: https://doi.org/10.1007/3-540-52337-6_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-52337-6
Online ISBN: 978-3-540-46965-0
eBook Packages: Springer Book Archive