Compiling conceptual graphs

  • Gerard Ellis
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 567)


This paper examines storage and retrieval of conceptual graphs using a directed acyclic graph data structure based on the partial order over conceptual graphs. We show how conceptual graphs in this hierarchy can be compiled into instructions which represent specialized cases of the canonical formation rules. 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. Compilation of conceptual graphs 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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    John F. Sowa. Conceptual Structures: Information in Mind and Machine. Addison-Wesley, Reading, MA, 1984.Google Scholar
  2. [2]
    John F. Sowa. Conceptual structures bibliography. In Peter Eklund and Laurie Gerholz, editors, Proceedings of the 5th Annual Conceptual Structures Workshop, 91-7870-718-8, Boston&Stockholm, 1990. Linköping University.Google Scholar
  3. [3]
    Christoph Walther. A Many-Sorted Calculus Based on Resolution and Paramodulation. Research Notes in Artificial Intelligence. Morgan Kaufmann, 1987.Google Scholar
  4. [4]
    Nick J. Davies. Schubert's steamroller in a natural deduction theorem prover. In D. S. Moralee, editor, Proceedings of Expert Systems 87, pages 89–102, 1987. Research and Development in Expert Systems IV.Google Scholar
  5. [5]
    Mark E. Stickel. Schubert's steamroller problem: Formulations and solutions. Automated Reasoning, 2(1):89–101, 1986.Google Scholar
  6. [6]
    Don D. Roberts. The Existential Graphs of Charles S. Peirce, Mouton, The Hague, 1973.Google Scholar
  7. [7]
    Robert A. Levinson. A Self-Organizing Retrieval System for Graphs. PhD thesis, University of Texas, May 1985.Google Scholar
  8. [8]
    Robert A. Levinson. Pattern associativity and the retrieval of semantic networks. Computers and Mathematics with Applications, 1991. To appear in the Special Edition on Semantic Networks.Google Scholar
  9. [9]
    Brian J. Garner and Eric Tsui. A self-organizing dictionary for conceptual structures. In J. F. Gilmore, editor, Proceedings of the Conference on Applications of Artificial Intelligence, pages 356–363, 1987. SPIE Proc. 784, 18–20th May, Orlando.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Gerard Ellis
    • 1
  1. 1.Department of Computer ScienceUniversity of Queensland BrisbaneQueenslandAustralia

Personalised recommendations