Partially Isomorphic Generalization and Analogical Reasoning
Eiju Hirowatari, Setsuo Arikawa, 栄寿 廣渡, 節夫 有川 · Institutional Repositories DataBase (IRDB) · 1993
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 partially isomorphic generalizations of atoms and rules which make it possible to carry out analogical reasoning without computing the analogy, and also gives a relationship between our generalization and the analogy. Then, we give a procedure which produces such a generalization in polynomial time with respect to the length of a given atom or rule, and realize it as a Prolog program. 1 Introduction Analogical reasoning is an important paradigm of machine learning [1, 5, 6]. it acquires unknown knowledge by computing an analogy, which gives a similarity between a base domain and a target domain. In analogical reasoning, we first detect an analogy, and then project the well-known knowledge in the base domai...