Partially Isomorphic Generalization and Analogical Reasoning
Abstract
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.
Cite
Text
Hirowatari and Arikawa. "Partially Isomorphic Generalization and Analogical Reasoning." European Conference on Machine Learning, 1994. doi:10.1007/3-540-57868-4_74Markdown
[Hirowatari and Arikawa. "Partially Isomorphic Generalization and Analogical Reasoning." European Conference on Machine Learning, 1994.](https://mlanthology.org/ecmlpkdd/1994/hirowatari1994ecml-partially/) doi:10.1007/3-540-57868-4_74BibTeX
@inproceedings{hirowatari1994ecml-partially,
title = {{Partially Isomorphic Generalization and Analogical Reasoning}},
author = {Hirowatari, Eizyu and Arikawa, Setsuo},
booktitle = {European Conference on Machine Learning},
year = {1994},
pages = {363-366},
doi = {10.1007/3-540-57868-4_74},
url = {https://mlanthology.org/ecmlpkdd/1994/hirowatari1994ecml-partially/}
}