Abstract
L-LILOG II is a knowledge representation language based on order-sorted predicate logic. It is used in a text understanding system to represent the meaning of natural language texts and to represent the background knowledge. An inference system for L-LILOG II has been developed including a control component which restricts the possible inferences and guides the search for proofs. This control of reasoning is based to some extend on meta knowledge, i.e. knowledge about knowledge, which is also represented in L-LILOG II. This paper provides an overview of the inference system and describes the knowledge based control of reasoning in more detail.
Essential parts of this work have been done while the authors jointly were at IBM
Chapter PDF
References
C. Beierle, J. Dörre, U. Pletat, P.H. Schmitt, R. Studer: The Knowledge Representation Language L-LILOG. LILOG-Report 41, IBM Germany, Stuttgart, 1988.
T. Bollinger, U. Hedtstück, C.-R. Rollinger: Reasoning in Text Understanding, Knowledge Processing in the LILOG-Prototype. LILOG-Report 49, IBM Deutschland, Stuttgart, 1988.
A.G. Cohn: A More Expressive Formulation of Many Sorted Logic. Journal of Automated Reasoning 3, 113–200, 1987.
V.J. Digricoli: Resolution by Unification and Equality. Proc. 4th Workshop on Automated Deduction, Texas, 1979.
C. Habel: Zwischen-Bericht. In: C. Habel, M. Herweg, K. Rehkämper (eds.): Raumkonzepte in Verstehensprozessen. Niemeyer Verlag, Tübingen, 1989.
P.J. Hayes: Computation and Deduction. Proc. 2nd MFCS Symp., Czechoslovakian Academy of Sciences, 105–118, 1973.
U. Hedtstück, P.H. Schmitt: A Calculus for Order Sorted Predicate Logic with Sort Literals (this volume).
M.N. Khenkhar: DEPIC-2D: Eine Komponente zur depiktionalen Repräsentation und Verarbeitung räumlichen Wissens. in D. Metzing (ed.):GWAl-89 13th German Workshop on Artificial Intelligence, Informatik Fachberichte 216, Springer Verlag, 1989.
K. Klabunde: Erweiterung der Wissensrepräsentationssprache L-LILOG um Konstrukte zur Spezifikation von Kontrollinformation. Diplomarbeit, EWH Koblenz, 1989.
R. Kowalski: A Proof Procedure Using Connection Graphs, JACM Vol 22, No.4, 1975.
U. Pletat, K. v. Luck: Knowledge Representation in LILOG (this volume).
J. Gemander: Schlußfolgern unter Vagheit und / oder Unsicherhert. Diploma thesis No. 586, Institut für Informatik, Universität Stuttgart, 1989.
G. Robinson, L. Wos: Paramodulation and TP in first order Theories with Equality. Machine Intelligence 4, 135–150, 1969.
M. Schmidt-Schauss: Computational Aspects of an Order-Sorted Logic with Term Declarations. LCNS vol. 395, Springer, 1989.
C. Walther: A Many-Sorted Calculus Based on Resolution and Paramodulation. Research Notes in Artificial Intelligence, Pitman, London, and Morgan Kaufmann, Los Altos, 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bläsius, K.H., Rollinger, C.R., Siekmann, J.H. (1990). Structure and control of the L-LILOG Inference system. 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_23
Download citation
DOI: https://doi.org/10.1007/3-540-52337-6_23
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