Abstract
The core issue of analogical reasoning is the transfer of relational knowledge from a source case to a target problem. Visual analogical reasoning pertains to problems containing only visual knowledge. Holyoak and Thagard proposed that the retrieval and mapping tasks of analogy in general can be productively viewed as constraint satisfaction problems, and provided connectionist implementations of their proposal. In this paper, we reexamine the retrieval and mapping tasks of analogy in the context of diagrammatic cases, representing the spatial structure of source and target diagrams as semantic networks in which the nodes represent spatial elements and the links represent spatial relations. We use a method of constraint satisfaction with backtracking for the retrieval and mapping tasks, with subgraph isomorphism over a particular domain language as the similarity measure. Results in the domain of 2D line drawings suggest that at least for this domain the above method is quite promising.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
