Which symbol grounding problem should we try to solve?

Journal of Experimental & Theoretical Artificial Intelligence 27 (1):73-78 (2015)
  Copy   BIBTEX

Abstract

Floridi and Taddeo propose a condition of “zero semantic commitment” for solutions to the grounding problem, and a solution to it. I argue briefly that their condition cannot be fulfilled, not even by their own solution. After a look at Luc Steels' very different competing suggestion, I suggest that we need to re-think what the problem is and what role the ‘goals’ in a system play in formulating the problem. On the basis of a proper understanding of computing, I come to the conclusion that the only sensible ground-ing problem is how we can explain and re-produce the behavioral ability and function of meaning in artificial computational agents

Author's Profile

Vincent C. Müller
Universität Erlangen-Nürnberg

Analytics

Added to PP
2015-09-17

Downloads
752 (#10,222)

6 months
50 (#26,091)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?