Analogical Reasoning as a Form of Hypothetical Reasoning

Ryohei ORIHARA  

Publication
IEICE TRANSACTIONS on Information and Systems   Vol.E75-D   No.4   pp.477-486
Publication Date: 1992/07/25
Online ISSN: 
Print ISSN: 0916-8532
Type of Manuscript: Special Section PAPER (Special Issue on Algorithmic Learning Theory)
Category: 
Keyword: 
artificial intelligence and cognitive science,  databases,  analogical reasoning,  logic programming,  hypothetical reasoning,  abduction,  generalized stable model,  

Full Text: PDF(741.5KB)
>>Buy this Article


Summary: 
The meaning of analogical reasoning in locally stratified logic programs are described by generalized stable model (GSM) semantics. Although studies on the theoretical aspects of analogical reasoning have recently been on the increase, there have been few attempts to give declarative semantics for analogical reasoning. This paper takes notice of the fact that GSM semantics gives meaning to the effect that the negated predicates represent exceptional cases. We define predicates that denote unusual cases regarding analogical reasoning; for example, ab(x)p(x)g(x), where p(s), q(s), p(t) are given. We also add rules with negated occurrences of such predicates into the original program. In this way, analogical models for original programs are given in the form of GSMs of extended programs. A proof procedure for this semantics is presented. The main objective of this paper is not to construct a practical analogical reasoning system, but rather to present a framework for analyzing characteristics of analogical reasoning.