- 著者
-
原口 誠
有川 節夫
- 出版者
- 一般社団法人 人工知能学会
- 雑誌
- 人工知能 (ISSN:21882266)
- 巻号頁・発行日
- vol.1, no.1, pp.132-139, 1986-09-01 (Released:2020-09-29)
- 被引用文献数
-
2
We present in this paper a formal theory of analogical reasoning. We are mainly concerned with three subjects, a formal definition of analogy, a formalization of the reasoning in terms of deduction, and a method for realizing the reasoning in a logic programming system. First we assume that each domain for the reasoning is represented by a set of definite clauses, and hence it is the least model for the set. Then we consider an analogy as a partial identity between the models. Secondly we introduce a notion of rule transformation to transform rules in one domain into those in the other. Then we can formalize the reasoning as a system with three inference rules, instantiation of rules, modus ponens, and the rule transformation. Finally, based on this formalization, we present an extended pure-Prolog interpreter which performs the detection of analogy and reasoning by the analogy at the same time.