Compiling Conceptual Graphs

The 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]  John F. Sowa,et al.  Conceptual Structures: Information Processing in Mind and Machine , 1983 .

[2]  William A. Woods,et al.  Understanding Subsumption and Taxonomy: A Framework for Progress , 1991, Principles of Semantic Networks.

[3]  Marie-Laure Mugnier,et al.  Characterization and Algorithmic Recognition of Canonical Conceptual Graphs , 1993, ICCS.

[4]  R. Levinson.  PATTERN ASSOCIATIVITY AND THE RETRIEVAL OF SEMANTIC NETWORKS , 1991 .

[5]  Robert Arlen Levinson.  A self-organizing retrieval system for graphs (organic, machine, chemistry, learning, partial-ordering) , 1985 .

[6]  James G. Schmolze,et al.  Classification in the KL-ONE Knowledge Representation System , 1983, IJCAI.

[7]  Guy W. Mineau.  Induction on conceptual graphs: finding common generalizations and compatible projections , 1992 .

[8]  Robert Levinson,et al.  A Self-Organizing Retrieval System for Graphs , 1984, AAAI.

[9]  D. Roberts.  The existential graphs , 1992 .

[10]  Robert Levinson,et al.  UDS: A Universal Data Structure , 1994, ICCS.

[11]  Gerard Ellis.  Compiling Conceptual Graphs , 1991, PDK.

[12]  Christoph Walther,et al.  A Many-Sorted Calculus Based on Resolution and Paramodulation , 1982, IJCAI.

[13]  M. Willems.  Knowledge graphs versus conceptual graphs , 1990 .

[14]  Eric Tsui,et al.  A Self-Organising Dictionary For Conceptual Structures , 1987, Other Conferences.

[15]  Hassan Aït-Kaci,et al.  Warren's Abstract Machine: A Tutorial Reconstruction , 1991 .

[16]  Robert Levinson,et al.  Adaptive Pattern-Oriented Chess , 1991, AAAI Conference on Artificial Intelligence.

[17]  N. J. Davies.  Schubert's steamroller in a natural deduction theorem prover , 1988 .