Skip to main content
SpringerLink
Log in

Two FOL semantics for simple and nested conceptual graphs

  • Conference paper
  • First Online:
Conceptual Structures: Theory, Tools and Applications (ICCS 1998)

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

Included in the following conference series:

Abstract

J.F. Sowa has defined a FOL semantics for Simple Conceptual Graphs and proved the soundness of the graph operation called projection with respect to this semantics. M. Chein and M.L. Mugnier have proved the completeness result, with a restriction on the form of the target graph of the projection. I propose here another FOL semantics for Simple Conceptual Graphs corresponding to a slightly different interpretation of a Conceptual Graph. Soundness and completeness of the projection with respect to this semantics are true without any restriction. I extend the definitions and results on both semantics to Conceptual Graphs containing co-reference links and to Nested Conceptual Graphs.

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.

References

  1. M. Chein and M.L. Mugnier. Conceptual Graphs: fondamental notions. Revue d'Intelligence Artificielle, 6(4): 365–406, 1992. Hermès, Paris.

    Google Scholar 

  2. M. Chein, M.L. Mugnier, and G. Simonet. Nested graphs: A graph-based knowledge representation model with fol semantics. In Proceedings of the Sixth International Conference on Principles of Knowledge Representation and Reasoning (KR'98), Trento, Italy, June 1998.

    Google Scholar 

  3. R.V. Guha. Contexts: a formalization and some applications. Technical Report ACT-CYC-42391, MCC, December 1991. PhD Thesis, Stanford University.

    Google Scholar 

  4. J. McCarthy. Notes on Formalizing Context. In Proc. IJCAI'93, pages 555–560, 1993.

    Google Scholar 

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

    Article  MATH  Google Scholar 

  6. A Preller, M.L. Mugnier, and M. Chein. Logic for Nested Graphs. Computational Intelligence Journal, (CI 95-02-558), 1996.

    Google Scholar 

  7. E. Salvat. Raisonner avec des opérations de graphes: graphes conceptuels et règles d'inférence. PhD thesis, Montpellier II University, France, December 1997.

    Google Scholar 

  8. E. Salvat and M.L. Mugnier. Sound and Complete Forward and Backward Chainings of Graph Rules. In ICCS'96, Lecture Notes in A.I. Springer Verlag, 1996.

    Google Scholar 

  9. G Simonet. Une autre sémantique logique pour les graphes conceptuels simples ou emboîtés. Research Report 96-048, L.I.R.M.M., 1996.

    Google Scholar 

  10. G Simonet. Une sémantique logique pour les graphes conceptuels emboîtés. Research Report 96-047, L.I.R.M.M., 1996.

    Google Scholar 

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

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIRMM (CNRS and Universit Montpellier II), 161, rue Ada, 34392, Montpellier Cedex 5, France

    G. Simonet

Authors
  1. G. Simonet
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marie-Laure Mugnier Michel Chein

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Simonet, G. (1998). Two FOL semantics for simple and nested conceptual graphs. In: Mugnier, ML., Chein, M. (eds) Conceptual Structures: Theory, Tools and Applications. ICCS 1998. Lecture Notes in Computer Science, vol 1453. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0054918

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64791-1

  • Online ISBN: 978-3-540-68673-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation