Year: 2004
Type: article
Abstract: Holyoak and Thagard proposed that the retrieval and mapping tasks of analogy can be viewed as constraint satisfaction problems, and described a connectionist implementation of their proposal.In this paper, we describe another constraint satisfaction method for the two tasks in the context of visual analogy: in our method, the source cases are organized in a discrimination tree, and all the source cases are searched at once.We also present an evaluation of the method for retrieval and mapping of 2-D line drawings from an external memory.The evaluation is based on structural constraints, and uses subgraph isomorphism as the similarity measure.One result is that a decomposition of the retrieval task into feature-based reminding and structure-based selection appears to provide little computational benefit over just selection.
Authors: Patrick W. Yaner, Ashok K. Goel
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2588549347