類推の定式化とその実現

概要

論文の詳細を見る
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.
社団法人人工知能学会の論文
1986-09-01