Characterization and algorithmic recognition of canonical conceptual graphs
- 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
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.
Unable to display preview. Download preview PDF.