Analog retrieval by constraint satisfaction

摘要

We describe a computational model of how analogs are retrieved from memory using simultaneous satisfaction of a set of semantic, structural, and pragmatic constraints. The model is based on psychological evidence suggesting that human memory retrieval tends to favor analogs that have several kinds of correspondences with the structure that prompts retrieval: semantic similarity, isomorphism, and pragmatic relevance. We describe ARCS, a program that demonstrates how these constraints can be used to select relevant analogs by forming a network of hypotheses and attempting to satisfy the constraints simultaneously. ARCS has been tested on several data bases that display both its psychological plausibility and computational power.