|Abstract||This article reviews eight proposed strategies for solving the Symbol Grounding Problem (SGP), which was given its classic formulation in Harnad (1990). After a concise introduction, we provide an analysis of the requirement that must be satisfied by any hypothesis seeking to solve the SGP, the zero semantical commitment condition. We then use it to assess the eight strategies, which are organised into three main approaches: representationalism, semi-representationalism and non-representationalism. The conclusion is that all the strategies are semantically committed and hence that none of them provides a valid solution to the SGP, which remains an open problem.|
|Keywords||No keywords specified (fix it)|
|Categories||No categories specified (fix it)|
|Through your library||Only published papers are available at libraries|
Similar books and articles
Stevan Harnad (2011). Lunch Uncertain [Review Of: Floridi, Luciano (2011) The Philosophy of Information (Oxford)]. [REVIEW] Times Literary Supplement 5664 (22-23).
M. A. van Rees (2001). The Diagnostic Power of the Stages of Critical Discussion in the Analysis and Evaluation of Problem-Solving Discussions. Argumentation 15 (4):457-470.
Stevan Harnad (1995). Grounding Symbols in Sensorimotor Categories with Neural Networks. Institute of Electrical Engineers Colloquium on "Grounding Representations.
Alvin I. Goldman (1983). Epistemology and the Theory of Problem Solving. Synthese 55 (1):21 - 48.
Stevan Harnad, Symbol Grounding is an Empirical Problem: Neural Nets Are Just a Candidate Component.
Karl F. MacDorman (1998). Feature Learning, Multiresolution Analysis, and Symbol Grounding. Behavioral and Brain Sciences 21 (1):32-33.
Dairon Rodríguez, Jorge Hermosillo & Bruno Lara (2012). Meaning in Artificial Agents: The Symbol Grounding Problem Revisited. Minds and Machines 22 (1):25-34.
Added to index2009-01-28
Total downloads21 ( #58,789 of 549,198 )
Recent downloads (6 months)2 ( #37,418 of 549,198 )
How can I increase my downloads?