Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Constuction of a model for reasoning by analogy
Chouraqui E.  Progress in artificial intelligence (, Orsay, France,1831985.Type:Proceedings
Date Reviewed: May 1 1986

This paper describes a method for reasoning by analogy, which is intended to provide the basis for one of the components of an AI system called ARCHES. This component is to be used whenever the deductive component of ARCHES is unable to solve a given problem. A key part of the method involves the introduction of a hypothesis which states that a certain dependency exists between parts A and B of a known situation P that is to be used as a basis for analogy. Now, if a similarity relationship is established between A and a part C of a new situation T, then the dependency hypothesis can be used to infer from C a new part D in T. This mode of reasoning can be seen as inference by analogy. It depends strongly on the dependency hypothesis, and on the availability of methods for acquiring, modifying, and selecting such hypotheses. This is a promising approach to “approximate reasoning,” and it is being explored currently by several investigators in the area of analogical reasoning.

While the paper discusses in some detail the issue of establishing similarity between parts of two situations, it does not deal with the issue of how dependency hypotheses come into being, and how they are selected by a system in the course of solving a problem. Also, the thorny issue of how a system decides that a problem cannot be solved by conventional deduction methods is not discussed. Some of the notation and formalisms used in the paper tend to obscure the main ideas. However, this is compensated for by a few good examples that illustrate the proposed approach quite effectively.

Reviewer:  S. Amarel Review #: CR109720
Bookmark and Share
 
Deduction And Theorem Proving (I.2.3 )
 
 
Analogies (I.2.6 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Deduction And Theorem Proving": Date
Noninteractive zero-knowledge
Blum M., De Santis A., Micali S., Persiano G. SIAM Journal on Computing 20(6): 1084-1118, 1991. Type: Article
Jan 1 1993
Cut elimination and automatic proof procedures
Zhang W. Theoretical Computer Science 91(2): 265-284, 1991. Type: Article
Apr 1 1993
A non-reified temporal logic
Bacchus F., Tenenberg J., Koomen J. Artificial Intelligence 52(1): 87-108, 1991. Type: Article
Oct 1 1992
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy