- Recherche et sélection de publications
|
A complexity based approach for solving Hofstadter's analogies
- Pierre-Alexandre Murena, Jean-Louis Dessalles, Antoine Cornuéjols
-
- References
- International Conference on Case-Based Reasoning (ICCBR 2017), Trondheim, Nor, July 2017, pp. 53--62
- 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.
- Keywords
- Category
- Paper in proceedings
- Research Area(s)
- Computer Science/Artificial Intelligence
Cognitive science/Computer science
Cognitive science/Linguistics
- Identifier(s)
-
Bibliographic key jld-17070302
- File(s)
-
- Export
-
- Last update
- on july 06, 2017 by Jean-Louis Dessalles
|
