A complexity based approach for solving Hofstadter's analogies - Archive ouverte HAL Access content directly
Conference Papers Year : 2017

A complexity based approach for solving Hofstadter's analogies

(1, 2) , (1, 2) ,
1
2

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.
Not file

Dates and versions

hal-02287592 , version 1 (13-09-2019)

Identifiers

  • HAL Id : hal-02287592 , version 1

Cite

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⟩
52 View
0 Download

Share

Gmail Facebook Twitter LinkedIn More