This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Knowledge Representation for Natural Language Understanding: The L_LILOG Approach
June 1993 (vol. 5 no. 3)
pp. 386-401

The logic-based knowledge representation language L_LILOG, which is used to represent both the semantic background knowledge as well as the information extracted from German texts within the LILOG project, is discussed. L_LILOG integrates frame-like features-value descriptions used in computational linguistics into an order-sorted predicated logic framework. The basis design principles of L_LILOG and examples of how L_LILOG is used to model real world knowledge are presented. The implementation of the first LILOG prototype is described. A formal semantics definition is provided.

[1] H. Aït-Kaci, "A lattice theoretic approach to computation based on a calculus of partially ordered type structures," Ph.D. dissertation, Univ. Penn., 1984.
[2] H. Ait-Kaci and R. Nasr, "LOGIN: A logic programming language with built-in inheritance,"J. Logic Program., vol. 3, no. 3, pp. 185-215, Oct. 1986.
[3] C. Beierle, J. Dörre, U. Pletat, C.-R. Rollinger, and R. Studer, "The knowledge representation language L-LILOG," in E. Börger, H. Kleine Büning, and M. M. Richter, Eds., CSL'88 -2nd Workshop on Computer Science Logic. Lecture Notes in Computer Science, Vol. 385. Berlin: Springer-Verlag, 1989, pp. 14-51.
[4] C. Beierle, U. Hedtstück, U. Pletat, P. H. Schmitt, and J. Siekmann, "An order-sorted logic for knowledge representation systems," IWBS Report 113, IBM Deutschland GmbH, Stuttgart, 1990. (to appear inArtificial Intell., 1992).
[5] C. Beierle and U. Pletat, "Feature graphs and abstract data types: A unifying approach," inProc. 12th Int. Conf. Computational Linguistics, Budapest, Hungary, 1988, pp. 40-45.
[6] C. Beierle, U. Pletat, and H. Uszkoreit, "An algebraic characterization of STUF," in I. S. Batori, U. Hahn, M. Pinkal, and W. Wahlster, Eds.,Computerlinguistik and ihre theoretischen Grundlagen. Informatik-Fachberichte 195. Berlin: Springer-Verlag, 1988.
[7] K. H. Bläsius, U. Hedtstück, and C.-R. Rollinger, Eds.Sorts and Types for Artificial Intelligence. Vol. 418,Lecture Notes in Artificial Intelligence. Berlin: Springer-Verlag, 1990.
[8] T. Bollinger, U. Hedtstück, and C.-R. Rollinger, "Reasoning for text-understanding--Knowledge processing in the 1st LILOG-prototype," inProc. GWAI-89. 13th German Workshop on Artificial Intell., D. Metzing, Ed., Berlin, 1989.
[9] T. Bollinger, U. Hedtstück, C.-R.Rollinger, and R. Studer, "Text understanding in LILOG," inLiguistic Approaches to AI, Schmitz and Kunz, Eds. Frankfurt, Germany: Peter Lang, 1988.
[10] T. Bollinger, I. Kreyss, and K. Neuhold, "Analysis of the knowledge processing in the first LILOG prototype," LILOG-Memo 13, IBM Germany, Scientific Center, Institute for Knowledge Based Systems, Stuttgart, 1988 (in German).
[11] G. Bouma, E. König, and H. Uszkoreit, "A flexible graph-unification formalism and its application to natural-language processing,"IBM J. Res. and Development, vol. 32, no. 2, 170-184, Mar. 1988.
[12] R. J. Brachman, "On the epistemological status of semantic networks," inAssociative Networks: Representation and Use of Knowledge by Computers, N.V. Findler, Ed. New York: Academic, 1979, pp. 3-50.
[13] R. J. Brachman, V. Pigman Gilbert, and H. J. Levesque, "An essential hybrid reasoning system: Knowledge and symbol level accounts in KRYPTON," inProc. 9th International Joint Conf. Artificial Intelligence, Los Angeles, CA, Aug. 1985, pp. 532-539.
[14] R. J. Brachman and J. G. Schmolze, "An overview of the KL-ONE knowledge representation system,"Cognitive Sci., vol. 9, no. 2, pp. 171-216, Apr. 1985.
[15] K. Dahlgren,Naive Semantics for Natural Language Understanding. Boston: Kluwer Academic, 1985.
[16] Ehrig, H., and B. Mahr,Fundamentals of Algebraic Specification 1, Springer-Verlag, Berlin, 1985.
[17] C. J. Fillmore, "The case for case," inUniversals in Linguistic Theory, Bach and Harms, Eds. New York: Holt, Rinehart and Winston, 1968, pp. 1-88.
[18] J. Goguen, "Order sorted algebra," Semantics and Theory of Computation Rep. No. 14, Univ. Caiif., Los Angeles, 1978.
[19] J. Goguen and R. Burstall,Institutions: Abstract Model Theory for Computer Science, CSLI Rep. No. 30, CSLI, Stanford, 1985.
[20] J. A. Goguen and J. Meseguer, "Order-sorted algebra I: Partial and overloaded operators, errors and inheritance," Tech. Rep., Comput. Sci. Lab., SRI International, Menlo Park, 1987.
[21] J. A. Goguen, J. W. Thatcher, and E. G. Wagner, "An initial algebra approach to the specification, correctness and implementation of abstract data types," inCurrent Trends in Programming Methodology IV. Data and Structuring, R. Yeh, Ed. Englewood Cliffs, NJ: Prentice Hall, 1978, pp. 80-144.
[22] H. Gust, P. Ludewig, and M. Rickheit.,The Structure of the LILOG Lexicon. LILOG-Report 29, IBM Deutschland GmbH, Stuttgart, 1986. (in German).
[23] O. Herzog, C.-R. Rollinger, P. Schmitt, P. Steffens, R. Studer, B. Wesche, Bartsch-Spörl, F. Guenthner, C. Habel, S. Kanngießer, and C. Rohrer, "LILOG-Linguistic and logic methods for the computational understanding of German," LILOG-Rep. 1b, IBM Deutschland GmbH, Stuttgart, 1986.
[24] K. S. Jones and B. Boguraev, A note on a study of cases.Computational Linguistics, vol. 13, nos. 1-2, pp. 65-68, 1987.
[25] R. M. Kaplan and J. Bresnan, "Lexical functional grammar: A formal system for grammatical representation," inThe Mental Representation of Grammatical Relations, J. Bresnan, Ed. Cambridge, MA: MIT Press, 1982, pp. 173-281.
[26] M. Kay, "Parsing in functional unification grammar," inNatural Language Parsing: Psychological, Computational, and Theoretical Perspectives, D. Dowty and L. Karttunen, Eds. Cambridge, Cambridge Univ. Press, 1985.
[27] T. Ludwig, B. Walter, M. Ley, A. Maier, and E. Gehlen, "LILOG-DB: Database-support for knowledge-based systems," inBTW-89. Berlin: Springer-Verlag, 1989.
[28] M. G. Moser, "An overview of NIKL, the new implementation of KLONE," inResearch in Knowledge Representation and Natural Language Understanding, pp. 7-26, BBN Rep. 5421, Bolt, Beranek, and Newman, Cambridge, MA, 1983.
[29] B. Nebel, "Reasoning and revision in hybrid representation systems," Ph.D. dissertation, Universität des Saarlandes, Saarbrücken, Germany, June 1989.
[30] A. Oberschelp, "Untersuchungen zur mehrsortigen Quantorenlogik,"Mathematische Annalen, vol. 145, pp. 297-333, 1962.
[31] U. Pletat and K. v. Luck, "Knowledge representation in LILOG," inSorts and Types for Artificial Intelligence, K. H. Bläsius, U. Hedtstück, and C.-R. Rollinger, Eds. Berlin: Springer-Verlag, 1990.
[32] S. Pribbenow, "Consistency checks for processing spatial knowledge," inGWAI-88. 12th German Workshop on Artificial Intelligence, Hoeppner, Ed. Berlin: Springer-Verlag, 1988.
[33] R. Reiter, "A logic for default reasoning,"Artificial Intell., vol. 13, no. 1, pp. 81-132, Apr. 1980.
[34] J. G. Schmolze, "The language and semantics of NIKL," Tech. Rep. 89-4, Tufts Univ., Dept. Comput. Sci., Medford, MA, 1989.
[35] S. Shieber, "An introduction to unification-based approaches to grammar," CSLI Lecture Notes 4, Center for the Study of Language and Information, Stanford Univ., Stanford, 1986.
[36] G. Smolka, "A feature logic with subsorts," LILOG-Report 33, IBM Deutschland GmbH, Stuttgart, 1988.
[37] G. Smolka and H. Aït-Kaci, "Inheritance hierarchies: Semantics and unification,"J. Symb. Comp., vol. 7, pp. 343-370, 1989.
[38] M.E. Stickel, "Automated deduction by theory resolution,"J. Auto. Reason., vol. 1, no. 4, pp. 333-355, 1985.
[39] D. Touretzky,The Mathematics of Inheritance Systems, San Mateo, CA: Morgan Kaufmann, 1986.
[40] H. Uszkoreit, "From feature bundles to abstract data types: New directions in the representation and processing of linguistic information," inNatural Language at the Computer - Contributions to Syntax and Semantics for Text Processing and Man-Maschine Translation, A. Blaser, Ed., Berlin: Springer-Verlag, 1988, pp. 31-64.
[41] M. B. Vilain, The restricted language architecture of a hybrid representation system. inProc. 9th Int. Joint Conf. Artificial Intelligence, pp. 547-551, Los Angeles, Cal., August 1985.
[42] K. v. Luck, B. Nebel, C. Peltason, and A. Schmiedel, "The anatomy of the BACK system," KIT Rep. 41, Dept. Comput. Sci., Technische Universität Berlin, Berlin, Germany, Jan. 1987.
[43] C. Walther, "Many-sorted unification,"J. ACM, vol. 35, no. 1, pp. 1-17, Jan. 1988.
[44] C. Walther, "A mechanical solution of Schubert's steamroller by many-sorted resolution,"Artificial Intell., vol. 26, pp. 217-224, 1985.
[45] W. A. Woods and J. G. Schmolze, "The KL-ONE Family," TR-20- 90, Harvard Univ., Center for Research in Computing Technology, Cambridge, MA, 1990. (to appear inComputers&Mathematics with Applications, Special Issue onSemantic Nerworks in Artificial Intelligence).

Index Terms:
natural language understanding; L/sub LILOG/ approach; logic-based knowledge representation language; semantic background knowledge; frame-like features-value descriptions; computational linguistics; order-sorted predicated logic framework; formal semantics; knowledge representation; natural languages
Citation:
C. Beierle, U. Pletat, R. Studer, "Knowledge Representation for Natural Language Understanding: The L_LILOG Approach," IEEE Transactions on Knowledge and Data Engineering, vol. 5, no. 3, pp. 386-401, June 1993, doi:10.1109/69.224192
Usage of this product signifies your acceptance of the Terms of Use.