Partially isomorphic generalization and analogical reasoning
Analogical reasoning is carried out based on an analogy which gives a similarity between a base domain and a target domain. Thus the analogy plays an important role in analogical reasoning. However, computing such an analogy leads to a combinatorial explosion. This paper introduces a notion of partially isomorphic generalizations of atoms and rules which makes it possible to carry out analogical reasoning without computing the analogy, and gives a relationship between our generalization and the analogy. Then we give a procedure which produces such a generalization in polynomial time.
- 1.Haraguchi, M., Arikawa, S.: A foundation of reasoning by analogy — analogical union of logic programs. In Proceedings of Logic Programming Conference (1986), Lecture Notes in Computer Science 264 (1987) 58–69Google Scholar
- 2.Haraguchi, M., Arikawa, S.: Reasoning by analogy as a partial identity between models. In Proceedings of First International Conference on Analogical and Inductive Inference, Lecture Notes in Computer Science 265 (1987) 61–87Google Scholar
- 3.Hirowatari, E., Arikawa, S.: Explanation-based generalization by analogical reasoning. In Proceedings of International Workshop on Inductive Logic Programming (1992)Google Scholar
- 4.Plotkin, G. D.: A note on inductive generalization. Machine Intelligence 5 (1970) 153–216Google Scholar
- 5.Reynolds, J. C.: Transformational systems and the algebraic structure of atomic formulas. Machine Intelligence 5 (1970) 135–151Google Scholar