REASONING BY ANALOGY AS A PARTIAL IDENTITY BETWEEN MODELS
スポンサーリンク
概要
- 論文の詳細を見る
We present in this paper a formal theory of reasoning by analogy. 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 the least model for logic program. Then we consider an analogy as a partial identity between the models. Secondly we introduce a notion of rule transformation which transforms 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 the formalization, we present an extended pure-Prolog interpreter which performs the detection of analogy and the reasoning by the partial identity at the same time.
- Research Association of Statistical Sciencesの論文
- 1987-03-00
Research Association of Statistical Sciences | 論文
- CLUSTERING BY A FUZZY METRIC : APPLICATIONS TO THE CLUSTER-MEDIAN PROBLEM
- A FAMILY OF REGRESSION MODELS HAVING PARTIALLY ADDITIVE AND MULTIPLICATIVE COVARIATE STRUCTURE
- AN OPTIMAL STOPPING PROBLEM ON TREE
- ON THE ORDERS OF MAX-MIN FUNCTIONALS
- TREE EXPRESSIONS AND THEIR PRODUCT FORMULA