Using transformations to improve semantic matching

Many AI tasks require determining whether two knowledge representations encode the same knowledge. Solving this matching problem is hard because representations may encode the same content but differ substantially in form. Previous approaches to this problem have used either syntactic measures, such as graph edit distance, or semantic knowledge to determine the "distance" between two representations. Although semantic approaches outperform syntactic ones, previous research has focused primarily on the use of taxonomic knowledge. We show that this is not enough because mismatches between representations go largely unaddressed. In this paper, we describe how transformations can augment existing semantic approaches to further improve matching. We also describe the application of our approach to the task of critiquing military Courses of Action and compare its performance to other leading algorithms.

[1]  Ken Barker,et al.  Transformation rules for knowledge-based pattern matching , 2003 .

[2]  Kenneth D. Forbus,et al.  Sketching for knowledge capture: a progress report , 2002, IUI '02.

[3]  Hans Chalupsky,et al.  OntoMorph: A Translation System for Symbolic Knowledge , 2000, KR.

[4]  Brian Falkenhainer,et al.  The Structure-Mapping Engine: Algorithm and Examples , 1989, Artif. Intell..

[5]  Mark A. Musen,et al.  An Algorithm for Merging and Aligning Ontologies: Automation and Tool Support , 1999 .

[6]  Ramanathan V. Guha,et al.  Building large knowledge-based systems , 1989 .

[7]  Michel Chein,et al.  An Experiment in Document Retrieval Using Conceptual Graphs , 1997, ICCS.

[8]  Yong Yu,et al.  Conceptual Graph Matching for Semantic Search , 2002, ICCS.

[9]  Elizabeth C. Wilson,et al.  The Knowledge Machine , 1968, Teachers College Record.

[10]  Dedre Gentner,et al.  Structure-Mapping: A Theoretical Framework for Analogy , 1983, Cogn. Sci..

[11]  Peter Clark,et al.  A library of generic concepts for composing knowledge bases , 2001, K-CAP '01.

[12]  Gary W. King,et al.  A Knowledge Acquisition Tool for Course of Action Analysis , 2003, IAAI.

[13]  Peter Clark,et al.  Building Concept Representations from Reusable Components , 1997, AAAI/IAAI.

[14]  A. Paone,et al.  Discrete Time Relaxation Based on Direct Quadrature Methods for Volterra Integral Equations , 1999, Computing.

[15]  Dan Corbett,et al.  Unification over Constraints in Conceptual Graphs , 1999, ICCS.

[16]  William A. Woods,et al.  Conceptual Indexing: A Better Way to Organize Knowledge , 1997 .

[17]  Guy W. Mineau Normalizing conceptual graphs , 1992 .

[18]  Nicola Guarino,et al.  OntoSeek: content-based access to the Web , 1999, IEEE Intell. Syst..

[19]  Robert M. Haralick,et al.  Structural Descriptions and Inexact Matching , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[20]  Sung H. Myaeng Conceptual graphs as a framework for text retrieval , 1992 .

[21]  Ramanathan V. Guha,et al.  Building Large Knowledge-Based Systems: Representation and Inference in the Cyc Project , 1990 .

[22]  King-Sun Fu,et al.  Error-Correcting Isomorphisms of Attributed Relational Graphs for Pattern Analysis , 1979, IEEE Transactions on Systems, Man, and Cybernetics.

[23]  Horst Bunke,et al.  A graph distance metric based on the maximal common subgraph , 1998, Pattern Recognit. Lett..

[24]  John F. Sowa,et al.  Conceptual Structures: Information Processing in Mind and Machine , 1983 .

[25]  King-Sun Fu,et al.  A distance measure between attributed relational graphs for pattern recognition , 1983, IEEE Transactions on Systems, Man, and Cybernetics.

[26]  Mark Willems Projection and Unification for Conceptual Graphs , 1995, ICCS.

[27]  Guy W. Mineau Facilitating the creation of a multiple index on graph-described documents by transforming their descriptions , 1993, CIKM '93.

[28]  Abraham Kandel,et al.  On the Minimum Common Supergraph of Two Graphs , 2000, Computing.

[29]  Marie-Laure Mugnier,et al.  Sound and Complete Forward and backward Chainingd of Graph Rules , 1996, ICCS.

[30]  Horst Bunke,et al.  A Network Based Approach to Exact and Inexact Graph Matching , 1993 .

[31]  Deborah L. McGuinness,et al.  An Environment for Merging and Testing Large Ontologies , 2000, KR.