A complexity based approach for solving Hofstadter’s analogies - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2017

A complexity based approach for solving Hofstadter’s analogies

Résumé

Analogical reasoning is a central problem both for human cognition and for artificial learning. Many aspects of this problem remain unsolved, though, and 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. In order to compute complexity, we present specifications for a prototype language used to describe analogies. A few elementary operators for this language are exposed, and their complexity is discussed both from a theoretical and practical point of view. We expose several alternative definitions of relevance in analogical reasoning and show how they are related to complexity.

Mots clés

Fichier non déposé

Dates et versions

hal-01556275 , version 1 (04-07-2017)

Identifiants

  • HAL Id : hal-01556275 , version 1
  • PRODINRA : 396710

Citer

Pierre Alexandre Murena, Jean-Louis Dessalles, Antoine Cornuéjols. A complexity based approach for solving Hofstadter’s analogies. CAW@ICCBR-2017 Computational Analogy Workshop, at International Conference on Case Based Reasoning, Jun 2017, Trondheim, Norway. ⟨hal-01556275⟩
83 Consultations
0 Téléchargements

Partager

Gmail Facebook X LinkedIn More