Characterization and algorithmic recognition of canonical conceptual graphs

  • M. L. Mugnier
  • M. Chein
Conference paper

DOI: 10.1007/3-540-56979-0_16

Part of the Lecture Notes in Computer Science book series (LNCS, volume 699)
Cite this paper as:
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-ConceptStruct 1993. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence), vol 699. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1993

Authors and Affiliations

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

Personalised recommendations