This Article 
 Bibliographic References 
 Add to: 
Compiling Conceptual Graphs
February 1995 (vol. 7 no. 1)
pp. 68-81

Abstract—This paper addresses problems in conceptual graph implementation: subsumption and classification in a taxonomy. Conceptual graphs are typically stored using a directed acyclic graph data structure based on the partial order over conceptual graphs.

We give an improved algorithm for classifying conceptual graphs into this hierarchy. It prunes the search space in the database using the information gathered while searching.

We show how conceptual graphs in this hierarchy can be compiled into instructions which represent specialized cases of the canonical formation rules. This compiles subsumption of conceptual graphs and compresses knowledge in a knowledge base. Conceptual graphs are compiled as differences between adjacent graphs in the hierarchy. The differences represent the rules used in deriving the graph from the adjacent graphs. We illustrate how the method compresses knowledge bases in some experiments.

Compilation is effected in three ways: removal of redundant data, use of simple instructions which ignore redundant checks when performing matching, and by sharing common processing between graphs.

[1] H. Aït-Kaci,Warren’s Abstract Machine, A Tutorial Reconstruction, MIT Press, Series on Logic Programming, Cambridge, Mass., 1991.
[2] G. Ellis,“Compiling conceptual graphs,” in P. Eklund and L. Gerholz, eds., Proc. Fifth Ann. Workshop Conceptual Graphs, ISBN 91-7870-718-8, Boston and Stockholm, Linköping Univ., 1990, pp. 23-32.
[3] G. Ellis,“Sorting conceptual graphs,” in P. Eklund and L. Gerholz, eds., Proc. Fifth Ann. Workshop Conceptual Graphs, ISBN 91-7870-718-8, Boston and Stockholm, Linköping Univ., 1990, pp. 265-280.
[4] B.J. Garner and E. Tsui,“A self-organizing dictionary for conceptual structures,” in J.F. Gilmore, ed., Proc. Conf. Applications Artificial Intelligence, SPIE Proc. 784, 1987, pp. 356-363.
[5] R.A. Levinson,A Self-Organizing Retrieval System for Graphs, Ph.D. thesis, Univ. of Texas, May 1985.
[6] R.A. Levinson,“Pattern associativity and the retrieval of semantic networks,” Computers&Mathematics with Applications J., Vol. 23, No. 2, 1992, pp. 573-600.
[7] R.A. Levinson,“UDS: A universal data structure,” Second Int’l Conf. Conceptual Structures, Springer-Verlag, Aug. 1994.
[8] R.A. Levinson and G. Ellis,“Multi-level hierarchical retrieval,” Knowledge Based Systems, Vol. 5, No. 3, Sept. 1992, pp. 233-244.
[9] R.A. Levinson and R. Snyder,“Adaptive pattern oriented chess,” Proc. AAAI 91, Morgan-Kaufman, 1991, pp. 601-605.
[10] G. Mineau,“Induction on conceptual graphs: Finding common generalizationsand compatible projections,” in J.A. Nagle and T.E. Nagle, eds., Proc. Fourth Ann. Workshop on Conceptual Graphs,Detroit, 1989.
[11] M.-L. Mugnier and M. Chein,“Characterization and algorithmic recognition of canonical conceptual graphs,” in G.W. Mineau, B. Moulin, and J.F. Sowa, eds., Conceptual Graphs for Knowledge Representation, Lecture Notes in Artificial Intelligence, Springer-Verlag, Berlin, No. 699, 1993, pp. 294-311.
[12] D.D. Roberts,The Existential Graphs of Charles S. Peirce, Mouton, The Hague, The Netherlands, 1973.
[13] J.G. Schmolze and T.A. Lipkis,“Classification in the (KL-ONE) knowledge representation system,” in A. Bundy, ed., Proc. Eighth Int’l Joint Conf. Artificial Intelligence, William Kaufmann Inc, 1983.
[14] J.F. Sowa, Conceptual Structures: Information Processing in Mind and Machine, Addison-Wesley, Reading, Mass., 1984.
[15] M. Willems,“Knowledge graphs versus conceptual graphs,” Tech. Report Memo 876, Univ. of Twente, 1990.
[16] W.A. Woods,“Understanding subsumption and taxonomy: A framework for progress,” in J.F. Sowa, ed., Principles of Semantic Networks: Explorations in the Representation of Knowledge, Morgan Kaufmann, San Mateo, Calif., 1991, pp. 45-94.

Index Terms:
Associative retrieval, compilation, conceptual graphs, hierarchical knowledge bases, partial orders.
Gerard Ellis, "Compiling Conceptual Graphs," IEEE Transactions on Knowledge and Data Engineering, vol. 7, no. 1, pp. 68-81, Feb. 1995, doi:10.1109/69.368517
Usage of this product signifies your acceptance of the Terms of Use.