Abstract
The graph structure of a conceptual graph can be used for efficient retrieval in complex (graphical) object databases. The aim is to replace most graph matching with efficient operations on precompiled codes for graphs. The unlabeled graph or “skeleton” of a type-labeled conceptual graph (without negated contexts) can be used as a filter for matching, subsumption testing, and unification. For two type-labeled graphs to match, their skeletons must first match. One type-labeled graph can subsume another only if its skeleton is included in that of the other. An skeleton-inclusion hierarchy can be constructed for a useful set of all possible skeletons up to a certain size. That hierarchy is then embedded in a Boolean lattice of bit-strings. Expensive graph comparison operations are traded for very fast bit-string logic operations on the codes. New graphs can be encoded at run time without recompiling the whole hierarchy: having found a graph's structural type, we then use it to hash to the code encoding the poset of all possible type-labeled graphs ordered by subsumption. Some of the order in that poset comes from the subgraph inclusion factor while other order comes from the “typelattice” (on concept-labels) factor. We show how they relate. We are investigating the bounds on code length and new methods of factorisation of conceptual graph databases.
Keywords
Much of the contribution of the first author was done while he was a PhD candidate in the Department of Computer Science at The University of Queensland, Brisbane, Australia, where he was financed by a University of Queensland Postgraduate Scholarship.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Hassan Aït-Kaci, Robert Boyer, Patrick Lincoln, and Roger Nasr. Efficient implementation of lattice operations. ACM Transactions on Programming Languages and Systems, 11(1):115–146, January 1989.
Robert W. Burch. Valental aspects of Peircean Algebraic Logic. In Fritz Lehmann, editor, Semantic Networks in Artificial Intelligence. Pergamon Press, Oxford, 1992. Also appeared in Comp. & Math. with Applications, 23(2–9), 1992, p. 665–667.
Yves Caseau. Efficient handfing of multiple inheritance hierarchies. In OOPSLA'93, Washington, September 1993.
A. G. Cohn. Completing sort hierarchies. Computers and Mathematics with Applications, 23(2–9):1–50, 1992. Also appears as Semantic Networks in Artificial Intelligence, F. Lehmann, ed., Pergamon Press, Oxford, 1992.
D. G. Cornell and D. G. Kirkpatrick. A theoretical analysis of various heuristics for the graph isomorphism problem. SIAM Journal of Computing, 9(2), 1980.
Veronica Dahl and Andrew Fall. Logical encoding of conceptual graph lattices. In Guy W. Mineau, Bernard Moulin, and John F. Sowa, editors, Proceedings of the 1st International Conference on Conceptual Structures, Quebec City, Quebec, Canada, August 4–7 1993. Universite Laval.
Gerard Ellis. Compiled hierarchical retrieval. In Tim Nagle, Jan Nagle, Laurie Gerholz, and Peter Eklund, editors, Conceptual Structures: Current Research and Practice, pages 285–310. Ellis Horwood, 1992.
Gerard Ellis. Efficient retrieval from hierarchies of objects using lattice operations. In Guy W. Mineau, Bernard Moulin, and John F. Sowa, editors, Conceptual Graphs for Knowledge Representation, number 699 in Lecture Notes in Artificial Intelligence, Berlin, 1993. Springer-Verlag. Proceedings of the 1st International Conference on Conceptual Structures, Quebec City, Canada, August 4–7.
John W. Esch, editor. Proceedings of the Third Annual Workshop on Conceptual Graphs, St. Paul, Minnesota, August 27 1988.
Leslie Ann Goldberg. Efficient Algorithms for Listing Combinatorial Structures. Cambridge University Press, Cambridge, 1993.
Fritz Lehmann. Semantic networks. Computers and Mathematics with Applications, 23(2–9):1–50, 1992. Also appears as Semantic Networks in Artificial Intelligence, F. Lehmann, ed., Pergamon Press, Oxford, 1992.
Fritz Lehmann. Combining ontological hierarchies. Technical Report 93-1, GRANDAI Software, 4282 Sandburg, Irvine, CA 92715, USA, March 1993.
George G. Lendaris. Representing conceptual graphs for parallel processing. In [9], 1988.
Robert A. Levinson. Pattern associativity and the retrieval of semantic networks. Computers & Mathematics with Applications Journal, 23(2):573–600, 1992. Part 2 of special issue on Semantic Networks in Artificial Intelligence, Fritz Lehmann, Guest Editor, Pergamon Press. Also in Semantic Networks in Artificial Intelligence, F. Lehmann, ed., Pergamon Press, Oxford, 1992. Also appears as Technical Report UCSC-CRL-90-30, University of California, Computer Research Laboratory, Santa Cruz, CA 95064.
Marie-Laure Mugnier and Michel Chein. Characterization and algorithmic recognition of canonical conceptual graphs. In Guy W. Mineau, Bernard Moulin, and John F. Sowa, editors, Conceptual Graphs for Knowledge Representation, number 699 in Lecture Notes in Artificial Intelligence, pages 294–311, Berlin, 1993. Springer-Verlag. Proceedings of the 1st International Conference on Conceptual Structures, Quebec City, Canada, August 4–7.
Sung H. Myaeng and Aurelio Lopez-Lopez. A flexible algorithm for matching conceptual graphs. In [19], 1991.
Arthur Frederick Parker-Rhodes. Inferential Semantics. Harvester Press/Humanities Press, Hassox, Sussex/Atlantic Highlands, N. J., 1978.
N.J.A. Sloane. The Handbook of Integer Sequences. Academic Press, San Diego, 1973.
Eileen Way, editor. Proceedings of the Sixth Annual Workshop on Conceptual Graphs, Binghamton, 1991. SUNY Binghamton.
Rudolf Wille. Restructuring lattice theory. In Ivan Rival, editor, Ordered Sets, Dordecht, Holland, 1982. D. Reidel. NATO AST Series C83.
Rudolf Wille. Lattices in Data Analysis: How to Draw Them with a Computer. NATO ASI Series C255. Kluwer, Dordecht, 1989.
Rudolf Wille. Knowledge acquisition by methods of formal concept analysis. In Ernest Diday, editor, Data Analysis, Learning Symbolic and Numerical Knowledge. Nova Science Publishers, New York-Budapest, 1991.
Rudolf Wille. Concept lattices and conceptual knowledge systems. In Fritz Lehmann, editor, Semantic Networks in Artificial Intelligence. Pergamon Press, Oxford, 1992. Also appeared in Comp. & Math. with Applications, 23(2–9), 1992, p. 493–515.
Monika Zickwolff. Rule Exploration: First Order Logic in Formal Concept Analysis. PhD thesis, der Technischen Hochschule Darmstadt, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ellis, G., Lehmann, F. (1994). Exploiting the induced order on type-labeled graphs for fast knowledge retrieval. In: Tepfenhart, W.M., Dick, J.P., Sowa, J.F. (eds) Conceptual Structures: Current Practices. ICCS 1994. Lecture Notes in Computer Science, vol 835. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58328-9_19
Download citation
DOI: https://doi.org/10.1007/3-540-58328-9_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58328-8
Online ISBN: 978-3-540-38675-9
eBook Packages: Springer Book Archive