Abstract
The knowledge representation language LLILOG can be characterized as a typed predicate logic offering a rich sort concept, defaults, and the possibility to control inference processes. Although the current major application of LLILOG is the natural language understanding framework of the LILOG project, the concepts of the language are general enough to use it also for other applications of knowledge based systems.
The current stage of development the knowledge representation language LLILOG should not be considered as a final state. We are thinking of several enhancements: the module concept for LLILOG as described here and formally defined in [Pletat 1991] will become part of the implementation of LLILOG. Thus well-established ideas known from languages like Modula ([Wirth 1985]) or Ada ( [Manual 1981]) will become available for knowledge representation based on LLILOG. Moreover, it has turned out during the development of the LEU/2 knowledge base that a polymorphic type concept (cf. [Gordon et al. 1978] or [Cardelli and Wegner 1985]) can be useful for several modeling situations.
The concepts underlying LLILOG have enough potential to make the language the logical basis of a general purpose knowledge representation system. The inference engine for LLILOG together with the other components that have to be considered as part of the implementation of LLILOG (the LLILOG compiler generating the internal representations on which the inference engine operates, the LILOG data base system we use for storing the compiled code of our knowledge bases, and the knowledge engineering tools supporting the development of LLILOG knowledge bases) could then form an advanced programming environment for knowledge based systems.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Björner, D. and Jones, C. B., editors. The Vienna Development Method: The Meta-Language, volume 61 of Lecture Notes in Computer Science. Springer Verlag, Berlin, Heidelberg, New York, 1978.
Bollinger, T. and Pletat, U. Knowledge in Operation. IWBS Report 165, IBM Deutschland, 1991.
Bollinger, T., Lorenz, S., and Pletat, U. The LILOG inference engine. In Text Understanding in LILOG: Integrating Computational Linguistics and Artificial Intelligence, Lecture Notes in Artificial Intelligence. Springer-Verlag, Berlin, Heidelberg, New York, this volume.
Bollinger, T. A Model Elimination Calculus for Generalized Clauses. In Proceedings IJCAI 91, 1991.
Bouma, G., Koenig, E., and Uszkoreit, H. A flexible graph-unification formalism and its application to natural-language processing. IBM Journal of Research and Development, 32(2):170–184, March 1988.
Brachman, R. J. and Levesque, H. J., editors. Readings in Knowledge Representation. Morgan Kaufmann, Los Altos, Cal., 1985.
Brachman, R. J. and Schmolze, J. G. An overview of the KL-ONE knowledge representation system. Cognitive Science, 9(2):171–216, April 1985.
Brachman, R. J. and Schmolze, J. G. An overview of the KL-ONE knowledge representation system. Cognitive Science, 9(2):171–216, April 1985.
Brachman, R. J., Gilbert, V. P., and Levesque, H. J. An Essential Hybrid Reasoning, System: Knowledge and Symbol Level Accounts of KRYPTON. In Proceedings IJCAI-85, pages 532–539, 1985.
Buchanan, B. G. and Shortliffe, E. H., editors. Rule-Based Expert Systems. Addison-Wesley, Reading, Massachusetts, 1985.
C. Beierle and J. Dörre and U. Pletat and C.-R. Rollinger and R. Studer. The knowledge representation language L-LILOG. In E. Börger and H. Kleine Büning and M. M. Richter, editor, CSL'88 — 2nd Workshop on Computer Science Logic. Lecture Notes in Computer Science, Volume 385, volume 385 of Lecture Notes in Computer Science, pages 14–51. Springer-Verlag, Berlin, Heidelberg, New York, 1989.
Cardelli, L. and Wegner, P. On Understanding Types, Data Abstraction and Polymorphism. Computing Surveys, 17(4):471–522, December 1985.
Dörre, J. and Seiffert, R. STUF — A formalism for natural language. In Text Understanding in LILOG: Integrating Computational Linguistics and Artificial Intelligence, Lecture Notes in Artificial Intelligence. Springer-Verlag, Berlin, Heidelberg, New York, this volume.
Ehrig, H. and Mahr, B. Fundamentals of Algebraic Specification 1 — Equations and Initial Semantics. EATCS Monographs on Theoretical Computer Science. Volume 6, Springer-Verlag, Berlin, Heidelberg, New York, 1985.
Ehrig, H. and Mahr, B. Fundamentals of Algebraic Specification 2 — Module Specifications and Constraints. EATCS Monographs on Theoretical Computer Science. Volume 21, Springer-Verlag, Berlin, Heidelberg, New York, 1990.
Ginsberg, M. L., editor. Readings in Nonmonotonic Reasoning. Morgan Kaufmann, Los Altos, Cal., 1987.
Goguen, J. and Burstall, R. Introducing institutions. In Clarke, E. and Kozen, D., editors, Proceedings, Logics of Programming Workshop, volume 164 of Lectures Notes in Computer Science, pages 221–256, Berlin, Heidelberg, New York, 1984. Springer-Verlag.
Goguen, Joseph A., Thatcher, James W., and Wagner, Eric G. An initial algebra approach to the specification, correctness and implementation of abstract data types. In Yeh, R., editor, Current Trends in Programming Methodology IV: Data and Structuring, pages 80–144. Prentice Hall, 1978.
Gordon, M., Milner, R., and Wadsworth, C. Edinburgh LCF, volume 78 of Lecture Notes in COmputer Science. Springer Verlag, Heidelberg, 1978.
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.
Horty, J. F., Thomason, R. H., and Touretzky, D. S. A sceptical theory of onheritance in semantic networks. In Proceedings of the 6th National Conference of the American Association for Artificial Intelligence, 1987.
Jensen, K. and Wirth, N. PASCAL: User Manual and Report. Springer Verlag, Heidelberg, 1975.
Kasper, R. T. and Rounds, W. C. A logical semantics for feature structures. In Proceedings of the 24th Annual Meeting of the Association for Computational Linguistics, pages 257–265, Columbia University, New York, 1986.
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, Berlin, West Germany, 1989.
Klose, G. and Luck, K. von. The representation of knowledge 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.
Lenat, D. CYC: Toward Programs with Common Sense. Communications of The ACM, 33, 1990.
Lorenz, S. Nichtmonotones Schließen mit ordnungssortierten Defaults. IWBS-Report 100, IBM Deutschland, Scientific Center, January 1990.
Manual, ADA Reference. The Programming Language ADA. Springer Verlag, Berlin, Heidelberg, New York, 1981.
McCarthy, J. Circumscription—a form of non-monotonic reasoning. Artificial Intelligence, 13(1–2):27–39, 1980.
Oberschelp, A. Untersuchungen zur mehrsortigen Quantorenlogik. Mathematische Annalen, 145:297–333, 1962.
Pereira, F. and Shieber, S. M. The Semantics of Grammar Formalisms seen as Computer Languages. In Proceedings of 10th International Conference on Computational Linguistics, pages 123–129, Stanford, 1984.
Pletat, U. and Luck, K. v. Knowledge Representation in LILOG. In K. H. Bläsius and U. Hedtstück and C.-R. Rollinger, editor, Sorts and Types for Artificial Intelligence, volume 449 of Lecture Notes in Artificial Intelligence. Springer-Verlag, Berlin, Heidelberg, New York, 1990.
Pletat, U. Modularizing knowledge in LLILOG. IWBS Report 173, IBM Deutschland, 1991.
Reiter, Raymond. A logic for default reasoning. Artificial Intelligence, 13(1):81–132, April 1980.
Schlechta, K. Defeasible Inheritance: Coherence Properties and Semantics. In Morreau, Michael, editor, SNS-Bericht 89-47. Seminar für natürlich-sprachliche Systeme, Univertsität Tübingen, 1989.
Smolka, G. A Feature Logic with Subsorts. Lilog-report 33, IBM Deutschland GmbH, Stuttgart, 1988.
Walther, C. A Many-Sorted Calculus Based on Resolution and Paramodulation. Research Notes in Artificial Intelligence. Pitman, London, and Morgan Kaufmann, Los Altos, Calif., 1987.
Wirth, N. Programming in Modula 2. Springer Verlag, Heidelberg, 1985.
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Pletat, U. (1991). The knowledge representation language LLILOG . 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_69
Download citation
DOI: https://doi.org/10.1007/3-540-54594-8_69
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