Solving the Symbol Grounding Problem: a Critical Review of Fifteen Years of Research

Taddeo, Mariarosaria and Floridi, Luciano (2005) Solving the Symbol Grounding Problem: a Critical Review of Fifteen Years of Research.

Full text available as:
PDF - Requires a viewer, such as Adobe Acrobat Reader or other PDF viewer.

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:artificial agent, representationalism, semantical commitment, semantics, symbol grounding problem
Subjects:Specific Sciences: Computer Science: Artificial Intelligence
ID Code:2542
Deposited By:Floridi, Luciano
Deposited On:27 November 2005
Additional Information:forthcoming in Journal of Experimental and Theoretical Artificial Intelligence