Dissemin is shutting down on January 1st, 2025

Published in

SSRN Electronic Journal, 2005

DOI: 10.2139/ssrn.3845295

Taylor and Francis Group, Journal of Experimental and Theoretical Artificial Intelligence, 4(17), p. 419-445, 2005

DOI: 10.1080/09528130500284053

Links

Tools

Export citation

Search in Google Scholar

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

Journal article published in 2005 by Mariarosaria Taddeo, Luciano Floridi ORCID
This paper is available in a repository.
This paper is available in a repository.

Full text: Download

Green circle
Preprint: archiving allowed
Upload
Red circle
Postprint: archiving forbidden
Red circle
Published version: archiving forbidden
Policy details
Data provided by SHERPA/RoMEO

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.