Skip to main content
SpringerLink
Log in

Characterization and algorithmic recognition of canonical conceptual graphs

  • Conference paper
  • First Online:
Conceptual Graphs for Knowledge Representation (ICCS 1993)

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

Included in the following conference series:

Abstract

This paper studies canonical graphs, which are conceptual graphs derivable from a canonical basis. We provide several characterizations of canonical graphs and prove that the correspondence between notions of a projection and a derivation sequence (specialization) holds true for canonical graphs. We propose an algorithm for deciding whether a conceptual graph is canonical relative to a given canonical basis. The complexity of this algorithm is polynomially related to the complexity of computing a projection between two conceptual graphs. When the canonical basis is a set of trees, it is polynomial.

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: fundamental notions. Revue d'Intelligence Artificielle, 6(4), 1992. Also available as R.R. LIRMM, 188, Nov. 1991.

    Google Scholar 

  2. M. Chein and M.L. Mugnier. Specialization: where do the difficulties occur? In Proc. 7th Workshop on Conceptual Graphs, New Mexico State University, Las Cruces, New Mexico, 1992.

    Google Scholar 

  3. P. Kocura and K. Kwong Ho. Aspect of a Conceptual Graph Processor Design. In Proc. 6th Annual Workshop on Conceptual Graphs, 1991.

    Google Scholar 

  4. M.L. Mugnier and M. Chein. Polynomial algorithms for projection and matching. In Proc. 7th Workshop on Conceptual Graphs, New Mexico State University, Las Cruces, New Mexico, 1992.

    Google Scholar 

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

    Google Scholar 

  6. G. Sabah and A. Vilnat. Flexible Case Structure Implemented into a Deterministic Parser. In Proc. 6th Annual Workshop on Conceptual Graphs, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIRMM, CNRS et Université Montpellier II, 161, rue Ada, 343392, Montpellier Cedex 5, France

    M. L. Mugnier & M. Chein

Authors
  1. M. L. Mugnier
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Chein
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Guy W. Mineau Bernard Moulin John F. Sowa

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Mugnier, M.L., Chein, M. (1993). Characterization and algorithmic recognition of canonical conceptual graphs. In: Mineau, G.W., Moulin, B., Sowa, J.F. (eds) Conceptual Graphs for Knowledge Representation. ICCS 1993. Lecture Notes in Computer Science, vol 699. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56979-0_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-56979-0_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56979-4

  • Online ISBN: 978-3-540-47848-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation