ICCS 2013: Conceptual Structures for STEM Research and Education pp 239-244 | Cite as
Cross-Domain Inference Using Conceptual Graphs in Context of Laws of Science
Abstract
Knowledge bases, as conceptual graphs, are considered to be brittle as they are highly domain specific. This paper attempts to get some flexibility by predicting the possible nodes, using the other existing graphs. Graph theory principles of maximum common sub-graph and minimum common super-graph for labelled graphs, allow extension of a given conceptual graph. This paper attempts to solve this problem for laws of science. Given a few fundamental equations of two different domains, but similar mathematical structure,equations can be converted to a common set of dummy variables. These transformed equations will be the labels for further set operations. Extending the two graphs using the minimum common super-graph and maximum common super-graph, we then convert these transformed equations back to their original variables. Then, apply constraints to check the feasibility and finalize this extension. Thus we have inferred some part of the knowledge base from other domains.
Keywords
Labeled graph Maximum Common sub-graph Minimum Common super-graph Cross-Domain InferencePreview
Unable to display preview. Download preview PDF.
References
- 1.Berg-Cross, G., Price, M.E.: Acquiring and Managing Knowledge Using a Conceptual Structures Approach: Introduction and Framework. IEEE Transactions on Systems, Man, and Cybernetics 19(3) (1989)Google Scholar
- 2.Bunke, H., Shearer, K.: A graph distance metric based on the maximal common subgraph. Pattern Rec. Lett. 19, 255–259 (1998)MATHCrossRefGoogle Scholar
- 3.Bunke, H., Jiang, X., Bern, Kandel, A.: On the Minimum Common Supergraph of Two Graphs. Computing 65(1), 13–15 (2000)MathSciNetMATHGoogle Scholar
- 4.Welling, R.: A Performance Analysis on Maximal Common Subgraph Algorithms. In: 15th Twente Student Conference on IT, Enschede, The Netherlands. University of Twente (2011)Google Scholar