Skip to main content

Aspects of consistency of sophisticated knowledge representation languages

  • Conference paper
  • First Online:
Natural Language and Logic

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 459))

Abstract

The growing interest and the importance of knowledge based systems increase the demand for knowledge representation formalisms supporting the adequate representation of the knowledge to be processed within such systems. The logic-based knowledge representation language L LILOG has emerged from applications in the area of natural language understanding and offers a sophisticated type concept integrating sort description features typically present in languages of the KL-ONE family into the framework of an order-sorted predicate logic. For languages with such rich type systems several consistency problems arise that are not present in neither of the parent languages: order-sorted predicate logic and KL-ONE. We provide a first collection of criteria assuring the existence of models for L LILOG knowledge bases and discuss the relationship between L LILOG and other approaches to sorted knowledge representation languages.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. C. Beierle, J. Dörre, U. Pletat, C. Rollinger, P.H. Schmitt, R. Studer: The Knowledge Representation Language L LILOG. Proc. 2nd Workshop on Computer Science Logic 1988, E. Börger, H. Kleine Büning, M. M. Richter (eds), Lecture Notes in Computer Science, Vol. 385, Springer Verlag, Berlin 1989

    Google Scholar 

  2. 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

    Google Scholar 

  3. C. Beierle, U. Hedtstück, U. Pletat, J. Siekmann: An Order Sorted Predicate Logic with Closely Coupled Taxonomic Information. To appear, 1989

    Google Scholar 

  4. 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

    Google Scholar 

  5. R.J. Brachman: On The Epistomological Status of Semantic Networks In: Associative Networks: Representation and Use of Knowledge By Computers, N. V. Findler (ed.), Academic Press, New York 1979

    Google Scholar 

  6. R.J. Brachman, R.E. Fikes, H.J. Levesque: KRYPTON: Integrating Terminology and Assertion. Proc. of AAAI-83 1983 31–35

    Google Scholar 

  7. R.J. Brachman, J.G. Schmolze: An Overview of the KL-ONE Knowledge Representation System. Cognitive Science 9 (2) April 1985, 171–216

    Article  Google Scholar 

  8. R.J. Brachman, V. Pigman, Gilbert, H.J. Levesque: An Essential Hybrid Reasoning System. Proc. IJCAI-85, 1985, 532–539

    Google Scholar 

  9. A. G. Cohn: A More Expressive Formulation of Many Sorted Logic. Journal of Automated Reasoning, 3:113–200, 1987

    Google Scholar 

  10. H. Ehrig, B. Mahr: Foundations of Algebraic Specifications I. Springer Verlag, Berlin 1985

    Google Scholar 

  11. M. R. Genesereth, N. J. Nilsson: Logical Foundations of Artificial Intelligence Morgan Kaufmann Publishing, Los Altos 1987

    Google Scholar 

  12. J. A. Goguen, R. M Burstall: Institutions: Abstract Model Theory for Computer Science. SRI International Report 1985

    Google Scholar 

  13. J. A. Goguen, J. Meseguer: Order-Sorted Algebra I. SRI International Report 1987

    Google Scholar 

  14. O. Herzog et al.: LILOG — Linguistische und logische Methoden für das maschinelle Verstehen des Deutschen. IBM Deutschland GmbH, LILOG-Report 1a, 1986

    Google Scholar 

  15. R. T. Kasper, W. C. Rounds: A Logicical Semantics for Feature Structures. Proc. 24th ACL Meeting, 257–265, Columbia University 1986

    Google Scholar 

  16. K. v. Luck, B. Nebel, C. Peltason, A. Schmiedel The Anatomy of The BACK-System. BACK-System. TU Berlin, KIT-Report No. 41, Jan. 1987

    Google Scholar 

  17. 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

    Google Scholar 

  18. R. C. Moore: The Role of Logic in Knowledge Representation and Commonsense Reasoning Proc. AAAI-82

    Google Scholar 

  19. B. Nebel Reasoning and Revision in Hybrid Reasoning Systems. Ph. D. Thesis, University of Saarbrücken, 1989

    Google Scholar 

  20. B. Nebel, G. Smolka: Representation and Reasoning with Attributive Descriptions. Proc. Workshop ‘Order-Sorted Knowledge Representation and Inference Systems', Lecture Notes in Artificial Intelligence, Springer Verlag, Berlin 1989

    Google Scholar 

  21. A. Oberschelp: Untersuchungen zur mehrsortigen Quantorenlogik. Mathematische Annalen, 145:297–333, 1962

    Article  Google Scholar 

  22. P.F. Patel-Schneider: Small can be Beautiful in Knowledge Representation. Proc. IEEE Workshop on Principles of Knowledge-Based Systems, 1984, 11–19

    Google Scholar 

  23. U. Pletat: Model Theoretic Aspects of L LILOG IBM Germany, IWBS Technical Report, to appear 1990

    Google Scholar 

  24. U. Pletat,, K. v. Luck: Knowledge Representation in LILOG. Proc. Workshop ‘Order-Sorted Knowledge Representation and Inference Systems', Lecture Notes in Artificial Intelligence, Springer Verlag, Berlin 1989

    Google Scholar 

  25. J. A. Robinson: A Macine-Oriented Logic Based on The Resolution Principle. Journal of the ACM, Vol 12, 1965

    Google Scholar 

  26. M. Schmidt-Schauss: Subsumption in KL-ONE is Undecidable. Universität Kaiserslautern, SEKI-Report SR-88-14, 1988

    Google Scholar 

  27. S. Shieber: An Introduction to Unification-Based Approaches to Grammar. CSLI Lecture Notes 4, Stanford University 1986

    Google Scholar 

  28. G. Smolka: A Feature Logic with Subsorts. Wissenschaftliches Zentrum der IBM Deutschland, LILOG-Report 33, 1988

    Google Scholar 

  29. M. Vilain: The Restricted Language Architecture of a Hybrid Representation System. Proc. IJCAI-85, 1985, 547–551

    Google Scholar 

  30. C. Walther: A Many-Sorted Calculus Based on Resolution and Paramodulation. Research Notes in Artificial Intelligence, 1987

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Rudi Studer

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pletat, U. (1990). Aspects of consistency of sophisticated knowledge representation languages. 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_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-53082-7_22

  • 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

Publish with us

Policies and ethics