Skip to main content

Positive nested conceptual graphs

  • Knowledge Representation
  • 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 paper deals with positive (i.e. without negation) nested conceptual graphs (NCGs). We first give a general framework-graphs of graphs provided with morphism-for defining classes of NCGs. Then we define a new class of NCGs-typed NCGs- and we show that known kinds of NCGs can be described very simply as classes of the general framework. All NCG models considered generalize the simple CG model in the sense that they involve objects which are generalizations of simple CGs and reasonings on these objects are based on a graph operation (projection) which is a generalization of that used for simple CGs. Furthermore, the general framework introduced allows one to consider all these models as slight variations of a unique notion. This study has been initiated by applications we are currently involved in.

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. L. K. Schubert, Semantic Networks are in the eye of the Beholder, in Principles of Semantic Networks, J. F. Sowa (ed), Morgan Kaufmann, 95–108, 1991.

    Google Scholar 

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

    Google Scholar 

  3. M. Chein, and M.-L. Mugnier, Conceptual Graphs: fundamental notions, Revue d'intelligence artificielle, vol. 6, n°4, 365–406, 1992.

    Google Scholar 

  4. O. Haemmerlé, La plate-forme CoGITo: manuel d'utilisation, RR LIRMM 95012, 1995, 52 pages.

    Google Scholar 

  5. O. Guinaldo, CoGITo v3.3: module SGBD de graphes conceptuels. RR LIRMM 96022, 1996, 10 pages.

    Google Scholar 

  6. C.Bos, and B.Botella, P.Vanheeghe, Modelling and Simulating Human Behaviours with Conceptual Graphs, R. R. Isen, 1996.

    Google Scholar 

  7. C.Bos, and B.Botella, Modelling Stereotyped Behaviours in Human Organizations, in proceedings 7th Workshop on Knowledge Engineering: Methods and Languages, Milton Keynes, United Kingdom, 1996.

    Google Scholar 

  8. D. Genest, Une utilisation des graphes conceptuels pour la recherche documentaire. Mémoire de DEA d'informatique, LIRMM & Université Montpellier II, Juin 1996.

    Google Scholar 

  9. J. F. Sowa, Conceptual Graphs as a universal knowledge representation, in Semantic Networks in AI, F. Lehmann (ed), Pergamon Press, 75–94, 1992.

    Google Scholar 

  10. J. F. Sowa, Logical foundations for representing object-oriented systems, Journal of Experimental and Theoretical Artificial Intelligence, vol. 5, 1994.

    Google Scholar 

  11. B.C. Ghosh, Conceptual Graph Language, Ph.D. Thesis, Asian Institute of Technology, Bangkok, 1996.

    Google Scholar 

  12. B.C. Ghosh, and V. Wuvongse, Computational Situation Theory in the Conceptual Graph Language, in proceedings of ICCS'96, 188–202, Lecture Notes in AI, 1115, Springer Verlag, Berlin, 1996

    Google Scholar 

  13. M. Chein, and M.-L. Mugnier, Quelques classes de graphes emboîtés équivalentes, R.R. LIRMM 96-063, 1996, 64 pages.

    Google Scholar 

  14. P. M. Cohn, Universal Algebra, Harper & Row, New-york.

    Google Scholar 

  15. M.R. Garey, and D.S. Johnson, Computers and intractability — A guide to the Theory of NP-Completeness, W.H. Freeman and Co, 1979.

    Google Scholar 

  16. A. Nazarenko, Representing natural language causality in conceptual graphs: the higher order conceptual relation problem, in proceedings of ICCS'93, 205–222, Lecture Notes in AI, 699, Springer Verlag, Berlin, 1993.

    Google Scholar 

  17. J.P. Dick, Using Contexts to Represent Text, in proceedings of ICCS'94, 196–213, Lecture Notes in AI, 835, Springer Verlag, Berlin, 1994.

    Google Scholar 

  18. M.-L. Mugnier, and M. Chein, Représenter des connaissances et raisonner avec des graphes, Revue d'intelligence artificielle, numéro spécial “graphes conceptuels”, vol. 10, n°1, 7–56, 1996.

    Google Scholar 

  19. A. Preller, M.L. Mugnier, and M. Chein, A Logic for Nested Graphs, Computational Intelligence Journal, (to be published, reference number CI 95-02-558).

    Google Scholar 

  20. G. Simonet, Une sémantique logique pour les graphes emboîtés, R.R. LIRMM 96047, 1996.

    Google Scholar 

  21. J. McCarthy, Notes on Formalizing Context, in Proceedings of IJCAI'93, 555–560, 1993.

    Google Scholar 

  22. R. V. Guha, Contexts: a formalization and some applications, PhD Thesis, Stanford University, 1991.

    Google Scholar 

  23. S. Buvac, Quantificational Logic of Context, in Proceedings AAAI'96, 600–606,1996.

    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

Chein, M., Mugnier, ML. (1997). Positive nested conceptual graphs. 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/BFb0027911

Download citation

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

  • 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