Skip to Main content Skip to Navigation
Conference papers

A complexity based approach for solving Hofstadter's analogies

Abstract : Analogical reasoning is still a difficult task for machines. In this paper, we consider the problem of analogical reasoning and assume that the relevance of a solution can be measured by the complexity of the analogy. This hypothesis is tested in a basic alphanumeric micro-world.
Complete list of metadata
Contributor : TelecomParis HAL Connect in order to contact the contributor
Submitted on : Friday, September 13, 2019 - 5:07:45 PM
Last modification on : Wednesday, November 3, 2021 - 8:19:33 AM


  • HAL Id : hal-02287592, version 1


Pierre-Alexandre Murena, Jean-Louis Dessalles, Antoine Cornuéjols. A complexity based approach for solving Hofstadter's analogies. International Conference on Case-Based Reasoning (ICCBR 2017), Jul 2017, Trondheim, Northern Mariana Islands. pp.53-62. ⟨hal-02287592⟩



Record views