Advertisement

Characterization and algorithmic recognition of canonical conceptual graphs

  • M. L. Mugnier
  • M. Chein
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 699)

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.

Keywords

Canonical Basis Internal Operation Star Graph Maximal Path Graph Sequence 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [CM92a]
    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. [CM92b]
    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. [KH91]
    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. [MC92]
    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. [Sow84]
    J.F. Sowa. Conceptual structures — Information Processing in Mind and Machine. Addison-Wesley, 1984.Google Scholar
  6. [SV91]
    G. Sabah and A. Vilnat. Flexible Case Structure Implemented into a Deterministic Parser. In Proc. 6th Annual Workshop on Conceptual Graphs, 1991.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • M. L. Mugnier
    • 1
  • M. Chein
    • 1
  1. 1.LIRMMCNRS et Université Montpellier IIMontpellier Cedex 5France

Personalised recommendations