Abstract
In this paper we will investigate subsumption and unification for structured descripitons by considering conceptual graphs with their projection and (maximal) join. The importance of projection for conceptual graphs is well-known as it essentially defines a partial order (subsumption hierarchy) on the graphs, that allows one to speed up search considerably. We investigate the complexity of projection by introducing a weaker notion of structural similarity, polyprojection. We prove that a polyprojection implies a projection for so-called non-repeating conceptual graphs. Furthermore, we show that a polyprojection can be determined by a polynomial algorithm. Indeed, the algorithm presented generalizes well-known algorithms for subtree isomorphism, and subsumption between feature term graphs.
A maximal join is defined as the join on a maximally extended compatible projection. The operation is closely related to unification in feature logics and logic programming, but it is allows more flexibility of representation. In essence, a maximal join corresponds to the greatest lower bound of two conceptual graphs when the partial order due to projection is a lattice. Finally, unification of structured descriptions as maximal join is shown to be polynomially related to projection.
Preview
Unable to display preview. Download preview PDF.
References
H. Aït-Kaci. An algebraic semantics approach to the effective resolution of type equations. Theor. Comp. Sc., 45:293–351, 1986.
M. Chein and M.-L. Mugnier. Conceptual graphs: fundamental notions. Revue d'Intelligence Artificielle, to appear.
H. Ehrig. Tutorial Introduction to the Algebraic Approach to Graph Grammars, volume 291 of Lecture Notes in Computer Science. Springer-Verlag, 1987.
H. Herrlich and G.E. Strecker. Category Theory, Allyn and Bacon Inc., Boston, 1973.
K. Knight. Unification: a multidisciplinary survey. ACM Computing Surveys, 21(1), 1989.
M. Liquière and O. Brissac. A class of conceptual graphs with polynomial iso-projection. In W.M. Tepfenhart, J.P. Dick, and J.F. Sowa, editors, Proceedings Supplement of the 2nd International Conference on Conceptual Structures. University of Maryland, 1994.
M.-L. Mugnier and M. Chein. Polynomial algorithms for projection and matching. In H. Pfeiffer, editor, Proceedings of the 7th Annual Workshop on Conceptual Graphs. State University of New Mexico, 1992.
S.W. Reyner. An analysis of a good algorithm for the subtree problem. SIAM J. Computer, 6(4):730–732, 1977.
J. F. Sowa. Conceptual Structures: Information Processing in Mind and Machine. Addison-Wesley, Reading, 1984.
J.R. Ullmann. An algorithm for subgraph isomorphism. Journal of the ACM, 23(1):31–42, 1976.
M. Willems. Generalization of conceptual graphs. In E.C. Way, editor, Proceedings of the 6th Annual Workshop on Conceptual Graphs, Binghamton, 1991. State University of New York.
M. Willems. Subsumption of knowledge graphs. In H. Boley and M.M. Richter, editors, Processing Declarative Knowledge, volume 567 of Lecture Notes in Artificial Intelligence. Springer-Verlag, 1991.
M. Willems. Chemistry of Language: a graph-theoretical study of linguistic semantics. PhD thesis, University of Twente, Enschede, 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Willems, M. (1995). Projection and unification for conceptual graphs. In: Ellis, G., Levinson, R., Rich, W., Sowa, J.F. (eds) Conceptual Structures: Applications, Implementation and Theory. ICCS 1995. Lecture Notes in Computer Science, vol 954. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60161-9_44
Download citation
DOI: https://doi.org/10.1007/3-540-60161-9_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60161-6
Online ISBN: 978-3-540-49539-0
eBook Packages: Springer Book Archive