Title
Which symbol grounding problem should we try to solve?
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 Steel's 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 (syntactic) understanding of computing, I come to the conclusion that the only sensible grounding problem is how we can explain and re-produce the behavioural ability and function of meaning in artificial computational agents.
Year
DOI
Venue
2015
10.1080/0952813X.2014.940143
JOURNAL OF EXPERIMENTAL & THEORETICAL ARTIFICIAL INTELLIGENCE
Keywords
Field
DocType
symbol grounding,semantic commitment,Chinese room,grounding
Computer science,Symbol grounding,Chinese room,Ground,Artificial intelligence,Syntax
Journal
Volume
Issue
ISSN
27.0
SP1
0952-813X
Citations 
PageRank 
References 
0
0.34
4
Authors
1
Name
Order
Citations
PageRank
Vincent C. Müller1246.21