Skip to main content

Reasoning with type definitions

  • Formal Reasoning
  • Conference paper
  • First Online:
Conceptual Structures: Fulfilling Peirce's Dream (ICCS 1997)

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

Included in the following conference series:

Abstract

This article presents an extension of the basic model of conceptual graphs: the introduction of type definitions. We choose to consider definitions as sufficient and necessary conditions to belong to a type. We extend the specialization/generalization relation on conceptual graphs to take advantage of these definitions. Type contractions and type expansions are clearly defined. We establish the correspondence with projection by use of the atomic form of conceptual graphs. Finally, we give a logical interpretation of type definitions and prove than the correspondence between logical deduction and generalization relation is maintained.

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. G. Chaty and M. Chein. Réduction de graphes et systémes de Church-Rosser. R.A.I.R.O., 15(2):109–117, 1981.

    Google Scholar 

  2. M. Chein and M. Leclère. A cooperative program for the construction of a concept type lattice. In Supplement Proceedings of the Second International Conference on Conceptual Structures, pages 16–30, College Park, Maryland, USA, 1994.

    Google Scholar 

  3. M. Chein and M.L. Mugnier. Conceptual graphs: fundamental notions. Revue d'Intelligence Artificielle, 6(4):365–406, 1992.

    Google Scholar 

  4. G. Huet. Confluent reductions: Abstract properties and applications to term rewriting systems. J.A.C.M., 27:797–821, 1980.

    Google Scholar 

  5. M. Leclère. Le niveau terminologique du modèle des graphes conceptuels: construction et exploitation. PhD thesis, Université Montpellier 2, 1995.

    Google Scholar 

  6. M. Leclère. Raisonner avec des définitions de types dans le modèle des graphes conceptuels. Rapport de recherche 143, IRIN, Nantes, France, Novembre 1996.

    Google Scholar 

  7. T. Lipkis. A kl-one classifier. In J.G. Schmolze and R.J. Brachman, editors, Proceedings of the 1981 KL-ONE Workshop, pages 126–143, Jackson, New Hampshire, 1982. The proceedings have been published as BBN Report No. 4842 and Fairchild Technical Report No. 618.

    Google Scholar 

  8. M.-L. Mugnier and M. Chein. Représenter des connaissances et raisonner avec des graphes. Revue d'Intelligence Artificielle, 10(1):7–56, 1996.

    Google Scholar 

  9. J.F. Sowa. Conceptual Structures — Information Processing in Mind and Machine. Addison-Wesley, Reading, Massachusetts, 1984.

    Google Scholar 

  10. W.A. Woods and J.G. Schmolze. The kl-one family. In F. Lehmann, editor, Semantic Networks in Artificial Intelligence, pages 133–177, Pergamon Press, Oxford, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Dickson Lukose Harry Delugach Mary Keeler Leroy Searle John Sowa

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Leclére, M. (1997). Reasoning with type definitions. In: Lukose, D., Delugach, H., Keeler, M., Searle, L., Sowa, J. (eds) Conceptual Structures: Fulfilling Peirce's Dream. ICCS 1997. Lecture Notes in Computer Science, vol 1257. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0027886

Download citation

  • DOI: https://doi.org/10.1007/BFb0027886

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63308-2

  • Online ISBN: 978-3-540-69424-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics