Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

Attributive description formalisms ... and the rest of the world

  • Chapter
  • First Online:
Text Understanding in LILOG

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

Abstract

Research in knowledge representation has led to the development of so-called terminological logics, the purpose of which is to support the representation of the conceptual and terminological part of Artificial Intelligence applications. Independently, in computational linguistics, so-called feature logics have been developed which are aimed at representing the semantic and syntactic information natural language sentences convey. Since both of these logics rely mainly on attributes as the primary notational primitives for representing knowledge, they can be jointly characterized as attributive description formalisms.

Although the intended applications for terminological logics and feature logics are not identical, and the computational services of systems based on the respective formalisms are quite different for this reason, the logical foundations turn out to be very similar — as we pointed out elsewhere. In this paper, we will show how attributive description formalisms relate to “the rest of the world.” Recently, a number of formal results in the area of attributive description formalisms have been obtained by exploiting other research fields, such as formal language theory, automata theory, and modal logics. This connection between these different fields of formal research will be highlighted in the sequel.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  • AÏt-Kaci, H. (1984): A Lattice-Theoretic Approach to Computations Based on a Calculus of Partially Ordered Type Structures. PhD thesis, University of Pennsylvania, Philadelphia, PA

    Google Scholar 

  • Baader, F., Bürckert, H.-J., Nebel, B., Nutt, W., Smolka, G. (1991): On the expressivity of feature logics with negation, functional uncertainty, and sort equations. DFKI Report RR-91-01, German Research Center for Artificial Intelligence (DFKI), Saarbrücken

    Google Scholar 

  • Baader, F. (1990): Terminological cycles in KL-ONE-based knowledge representation languages. In: Proceedings of the 8th National Conference of the American Association for Artificial Intelligence, Boston, MA, pp. 621–626

    Google Scholar 

  • Baader, F. (1991): Augmenting concept languages by transitive closure of roles: an alternative to terminological cycles. In: Proceedings of the 12th International Joint Conference on Artificial Intelligence, Sydney, Australia. To appear

    Google Scholar 

  • Bergamaschi, S., Nebel, B. (1990): Theoretical foundations of complex object data models. Technical Report 74, CIOC-CNR, Bologna, Italy

    Google Scholar 

  • Boone, W. W. (1959): The word problem. Ann. of Math. 70(2), 207–265

    Google Scholar 

  • Borgida, A., Brachman, R. J., McGuinness, D. L., Resnick, L. A. (1989): CLASSIC: a structural data model for objects. In: Proceedings of the 1989 ACM SIGMOD International Conference on Mangement of Data, Portland, OR, pp. 59–67

    Google Scholar 

  • Bouma, G., König, E., Uszkoreit, H. (1988): A flexible graph-unification formalism and its application to natural-language processing. IBM Journal of Research and Development 32(2), 170–184

    Google Scholar 

  • Brachman, R. J., McGuinness, D. L., Patel-Schneider, P. F., Resnick, L. A., Borgida, A. (1991): Living with CLASSIC: when and how to use a KL-ONE-like language. In: Sowa, J. (ed.): Principles of Semantic Networks. Morgan Kaufmann, San Mateo, CA

    Google Scholar 

  • Brachman, R. J., Levesque, H. J. (1984): The tractability of subsumption in frame-based description languages. In: Proceedings of the 4th National Conference of the American Association for Artificial Intelligence, Austin, TX, pp. 34–37

    Google Scholar 

  • Brachman, R. J., Schmolze, J. G. (1985): An overview of the KL-ONE knowledge representation system. Cognitive Science 9(2), 171–216

    Article  Google Scholar 

  • Brachman, R. J. (1979): On the epistemological status of semantic networks. In: Findler, N. V. (ed.): Associative Networks: Representation and Use of Knowledge by Computers. Academic Press, New York, NY, pp. 3–50

    Google Scholar 

  • Donini, F. M., Lenzerini, M., Nardi, D., Nutt, W. (1991a): Tractable concept languages. In: Proceedings of the 12th International Joint Conference on Artificial Intelligence, Sydney, Australia. To appear

    Google Scholar 

  • Donini, F. M., Lenzerini, M., Nardi, D., Nutt, W. (1991b): The complexity of concept languages. In: Allen, J. A., Fikes, R., Sandewall, E. (eds.): Principles of Knowledge Representation and Reasoning: Proceedings of the 2nd International Conference, Cambridge, MA, pp. 151–162

    Google Scholar 

  • Dörre, J., Rounds, W. C. (1990): On subsumption and semi-unification in feature algebras. In: Proceedings of the 5th IEEE Symposium on Logic in Computer Science, Philadelphia, PA, pp. 301–310. Also available as IWBS Report 97, IWBS, IBM Germany, Stuttgart, December 1989

    Google Scholar 

  • Garey, M. R., Johnson, D. S. (1979): Computers and Intractability—A Guide to the Theory of NP-Completeness. Freeman, San Francisco, CA

    Google Scholar 

  • Halpern, J. Y., Moses, Y. (1985): A guide to the modal logics of knowledge and belief: Preliminary draft. In: Proceedings of the 9th International Joint Conference on Artificial Intelligence, Los Angeles, CA, pp. 480–490

    Google Scholar 

  • Hollunder, B., Nutt, W. (1990): Subsumption algorithms for concept languages. DFKI Report RR-90-04, German Research Center for Artificial Intelligence (DFKI), Kaiserslautern

    Google Scholar 

  • Johnson, M. (1987): Attribute-Value Logic and the Theory of Grammar. CSLI Lecture Notes 16, Center for the Study of Language and Information, Stanford University, Stanford, CA

    Google Scholar 

  • Kaplan, R. M., Bresnan, J. (1982): Lexical-functional grammar: a formal system for grammatical representation. In: Bresnan, J. (ed.): The Mental Representation of Grammatical Relations. MIT Press, Cambridge, MA, pp. 173–381

    Google Scholar 

  • Kaplan, R. M., Maxwell, J. T. III (1988): An algorithm for functional uncertainty. In: Proceedings of the 12th International Conference on Computational Linguistics, Budapest, Hungary, pp. 297–302

    Google Scholar 

  • Kasper, R. T., Rounds, W. C. (1986): A logical semantics for feature structures. In: Proceedings of the 24th Annual Meeting of the ACL, New York, NY, pp. 257–265

    Google Scholar 

  • Kasper, R. T. (1987): Feature Structures: A Logical Theory with Applications to Language Analysis. PhD thesis, University of Michigan, Ann Arbor, MI

    Google Scholar 

  • Kay, M. (1979): Functional grammar. In: Proceedings of the Fifth Annual Meeting of the Berkeley Linguistics Society, Berkeley, CA, Berkeley Linguistics Society

    Google Scholar 

  • Kay, M. (1985): Parsing in functional unification grammars. In: Dowty, D., Karttunen, L. (eds.): Natural Language Parsing. Cambridge University Press, Cambridge, UK

    Google Scholar 

  • Lécluse, C., Richard, P., Velez, F. (1989): Modeling complex structures in object-oriented databases. In: Proceedings of the 8th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database-Systems, pp. 360–367

    Google Scholar 

  • Lipkis, T. (1982): A KL-ONE classifier. In: Schmolze, J. G., Brachman, R. J. (eds.): Proceedings of the 1981 KL-ONE Workshop, Cambridge, MA, pp. 128–145. The proceedings have been published as BBN Report No. 4842 and Fairchild Technical Report No. 618

    Google Scholar 

  • Moser, M. G. (1983): An overview of NIKL, the new implementation of KL-ONE. In: Research in Knowledge Representation and Natural Language Understanding, BBN Report No. 5421. Bolt, Beranek, and Newman Inc., Cambridge, MA, pp. 7–26

    Google Scholar 

  • Nebel, B., Smolka, G. (1990): Representation and reasoning with attributive descriptions. In: Bläsius, K.-H., Hedtstück, U., Rollinger, C.-R. (eds.): Sorts and Types in Artificial Intelligence. Lecture Notes in Artificial Intelligence, Vol. 418, Springer-Verlag, Berlin, Heidelberg, New York, pp. 112–139. Also available as IWBS Report 81, IWBS, IBM Germany, Stuttgart, September 1989

    Google Scholar 

  • Nebel, B. (1988): Computational complexity of terminological reasoning in BACK. Artificial Intelligence 34(3), 371–383

    MathSciNet  Google Scholar 

  • Nebel, B. (1990a): Reasoning and Revision in Hybrid Representation Systems. Lecture Notes in Artificial Intelligence, Vol. 422, Springer-Verlag, Berlin, Heidelberg, New York

    Google Scholar 

  • Nebel, B. (1990b): Terminological reasoning is inherently intractable. Artificial Intelligence 43, 235–249. Also available as IWBS Report 82, IWBS, IBM Germany, Stuttgart, October 1989

    Google Scholar 

  • Nebel, B. (1991): Terminological cycles: Semantics and computational properties. In: Sowa, J. (ed.): Principles of Semantic Networks. Morgan Kaufmann, San Mateo, CA

    Google Scholar 

  • Patel-Schneider, P. F. (1989a): A four-valued semantics for terminological logics. Artificial Intelligence 38(3), 319–351

    Google Scholar 

  • Patel-Schneider, P. F. (1989b): Undecidability of subsumption in NIKL. Artificial Intelligence 39(2), 263–272

    Google Scholar 

  • Pletat, U., von Luck, K. (1990): Knowledge representation in LILOG. In: Bläsius, K.-H., Hedtstück, U., Rollinger, C. (eds.): Sorts and Types in Artificial Intelligence. Lecture Notes in Artificial Intelligence, Vol. 418, Springer-Verlag, Berlin, Heidelberg, New York, pp. 140–164

    Google Scholar 

  • Schild, K. (1988): Undecidability of U. KIT Report 67, Department of Computer Science, Technische Universität Berlin, Berlin, Germany

    Google Scholar 

  • Schild, K. (1991): A correspondence theory for terminological logics: Preliminary report. In: Proceedings of the 12th International Joint Conference on Artificial Intelligence, Sydney, Australia. To appear

    Google Scholar 

  • Schmidt-Schauß, M., Smolka, G. (1991): Attributive concept descriptions with complements. Artificial Intelligence 48, 1–26. Also available as IWBS Report 68, IWBS, IBM Germany, Stuttgart, June 1989

    Google Scholar 

  • Schmidt-Schauß, M. (1989): Subsumption in KL-ONE is undecidable. In: Brachman, R. J., Levesque, H. J., Reiter, R. (eds.): Principles of Knowledge Representation and Reasoning: Proceedings of the 1st International Conference, Toronto, ON, pp. 421–431

    Google Scholar 

  • Schmolze, J. G., Israel, D. J. (1983): KL-ONE: Semantics and classification. In: Research in Knowledge Representation and Natural Language Understanding, BBN Technical Report, No. 5421. Bolt, Beranek, and Newman Inc., Cambridge, MA, pp. 27–39

    Google Scholar 

  • Shieber, S. M. (1986): An Introduction to Unification-Based Approaches to Grammar. CSLI Lecture Notes 4, Center for the Study of Language and Information, Stanford University, Stanford, CA

    Google Scholar 

  • Smolka, G. (1988): A feature logic with subsorts. LILOG Report 33, IWBS, IBM Germany, Stuttgart. To appear in: J. Wedekind, C. Rohrer (eds.), Unification in Grammar. MIT Press, 1991

    Google Scholar 

  • Smolka, G. (1989): Feature constraint logics for unification grammars. IWBS Report 93, IWBS, IBM Germany, Stuttgart. To appear in the Journal of Logic Programming

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. DFKI GmbH, Stuhlsatzenhausweg 3, D-6600, Saarbrücken 11, Germany

    Gert Smolka

Authors
  1. Bernhard Nebel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gert Smolka
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Gert Smolka .

Editor information

Otthein Herzog Claus-Rainer Rollinger

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Nebel, B., Smolka, G. (1991). Attributive description formalisms ... and the rest of the world. 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_74

Download citation

  • DOI: https://doi.org/10.1007/3-540-54594-8_74

  • 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

Publish with us

Policies and ethics

Search

Navigation