LEARNING BY ANALOGY: FORMULATING AND GENERALIZING PLANS FROM PAST EXPERIENCE
Machine LearningPublished 1 January 1983
Jaime Carbonell
Citations71
SJR quartileQ1
SJR score1.15
SNIP2.14
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
Analogical reasoning is a powerful mechanism for exploiting past experience in planning and problem solving. This chapter outlines a theory of analogical problem solving based on an extension to means-ends analysis. An analogical transformation process is developed to extract knowledge from past successful problem-solving situations that bear a strong similarity to the current problem. Then, the investigation focuses on exploiting and extending the analogical reasoning model to generate useful exemplary solutions to related problems from which more general plans can be induced and refined. Starting with a general analogical inference engine, problem-solving experience is, in essence, compiled incrementally into effective procedures that solve various classes of problems in an increasingly reliable and direct manner.
Keywords
Computer Science
Artificial IntelligenceStrips: A new approach to the application of theorem proving to problem solving
4,073 Citations1971Richard Fikes, Nils J. Nilsson
A new problem solver called STRIPS is described that attempts to find a sequence of operators in a space of world models to transform a given initial world model into a model in which a given goal formula can be proven to be true.
Munich Personal RePEc Archive (Ludwig Maximilian University of Munich)A Structure for Plans and Behavior
1,160 Citations1977Earl D. Sacerdoti
Progress to date in the ability of a computer system to understand and reason about actions is described, and the structure of a plan of actions is as important for problem solving and execution monitoring as the nature of the actions themselves.
Artificial IntelligenceNon-monotonic logic I
891 Citations1980Drew McDermott, Jon Doyle
A model and proof theories, a proof procedure, and applications for one non-monotonic logic are developed, and it is proved the completeness of the non-Monotonic predicate calculus and the decidability of theNon- monotonic sentential calculus.
Communications of the ACMLearning and reasoning by analogy
525 Citations1980Patrick Henry Winston
A theory of analogy is presented and an implemented system that embodies the theory is described that is designed to answer questions about Hamlet by way of knowledge about Macbeth.
Cognitive ScienceLanguage and Memory*
337 Citations1980Roger C. Schank
A theory of MOPs (Memory Organization Packets), which serve as both processors and organizers of information in memory, enables effective categorization of experiences in episodic memory, which in turn enables better predictive understanding of new experiences.
Artificial IntelligenceInductive learning of structural descriptions
194 Citations1981Thomas G. Dietterich, Ryszard S. Michalski
Primary attention is given to methods of learning the simplest form of generalization, namely, the maximally specific conjunctive generalizations (MSC-generalizations) which completely characterize a single set of structural examples.
Artificial IntelligenceToward a model of representation changes
103 Citations1980Richard E. Korf
The first steps in the development of a computer model of the process of changing representations in problem solving are presented, and a language for expressing representations and an interpreter for applying the transformations to representations have been developed.
FigshareKnowledge acquisition from structural descriptions
68 Citations2018Frederick Hayes‐Roth, McDermott, John
Three tasks solved by a program which performs an interference matching algorithm are presented and several problems concerning the relational representation of examples and the induction of knowledge by interference matching are discussed.
Reminding and Memory Organization: An Introduction to MOPs.
68 Citations1979Roger C. Schank
A more fragmented, multi-level set of memory structures (MOPs), which are more flexible than scripts are hypothesized, which are also expected to account for other phenomena, particularly that of 'being reminded' of some previous situation by a current situation.
International Joint Conference on Artificial IntelligenceOn the construction of evaluation functions for large domains
47 Citations1979Hans Berliner
It is shown how to create sensitive evaluation functions and how to avoid stability problems in non-linear functions and two effects, not previously found in the literature: the suicide construction, and the blemish effect.
ACM SIGART BulletinInductive learning of relational productions
23 Citations1977Steven A. Vere
An operational theory for the generalization of productions for before-and-after situation pairs and situation sequences is developed, based on previous work in concept induction, and this theory has been computer implemented.