Abstract
The main purpose of this paper is to develop polynomial algorithms for the projection and matching operations on conceptual graphs. Since all interesting problems related to these operations are at least NP-complete — we will consider here the exhibition of a solution and counting the solutions — we propose to explore polynomial cases by restricting the form of the graphs or relaxing constraints on the operations. We examine the particular conceptual graphs whose underlying structure is a tree. Besides general or injective projections, we define intermediary kinds of projections. We then show how these notions can be extended to matchings.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. Chein and M.L. Mugnier. Conceptual graphs: fundamental notions. Research Report 188, LIRMM, Nov. 1991. 30 p.
J. Fargues, M.C. Landau, A. Dugourd, and L. Catach. Conceptual graphs for semantics and information processing. IBM Journal of Research and Development, 30(1):70–79, 1986.
M.R. Garey and D.S. Johnson. Computer and Intractibility — A Guide to the Theory of NP-Completeness. W.H. Freeman and co, 1979.
J.E. Hopcroft and R.M. Karp. A n 5/2 Algorithm for Maximum Matching in Bipartite Graphs. J. SIAM Comp., 2:225–231, 1973.
R. Levinson and G. Ellis. Multi-level hierarchical retrieval. In Proceedings of the 6th Annual Workshop on Conceptual Graphs, pages 67–81, 1991.
J. J. McGregor. Backtrack search algorithms and the maximal common subgraph problem. Software-Practice and Experience, 12:23–34, 1982.
S.H. Myaeng and A. Lopez-Lopez. A flexible matching algorithm for matching conceptual graphs. In Proceedings of the 6th Annual Workshop on Conceptual Graphs, pages 135–151, 1991.
M.L. Mugnier. Quelques aspects algorithmiques en représentation des connaissances — Algorithmes incrémentaux d'héritage multiple, Opérations sur les graphes conceptuels. PhD. thesis, to appear in October, 1992.
C.H. Papadimitriou and K. Steiglitz. Combinatorial Optimization: Algorithms and Complexity. Prentice Hall, 1982.
S.W. Reyner. An analysis of a good algorithm for the subtree problem. SIAM J. Computer, 6(4):130–132, 1977.
J.F. Sowa. Conceptual structures — Information Processing in Mind and Machine. Addison-Wesley, 1984.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag
About this paper
Cite this paper
Mugnier, M.L., Chein, M. (1993). Polynomial algorithms for projection and matching. In: Pfeiffer, H.D., Nagle, T.E. (eds) Conceptual Structures: Theory and Implementation. Lecture Notes in Computer Science, vol 754. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57454-9_19
Download citation
DOI: https://doi.org/10.1007/3-540-57454-9_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57454-5
Online ISBN: 978-3-540-48189-8
eBook Packages: Springer Book Archive