Characterization and algorithmic recognition of canonical conceptual graphs
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.
KeywordsCanonical Basis Internal Operation Star Graph Maximal Path Graph Sequence
Unable to display preview. Download preview PDF.
- [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
- [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
- [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
- [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
- [Sow84]J.F. Sowa. Conceptual structures — Information Processing in Mind and Machine. Addison-Wesley, 1984.Google Scholar
- [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