PhilSci Archive

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. [Preprint]

Download (352Kb) | Preview


    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.

    Export/Citation:EndNote | BibTeX | Dublin Core | ASCII/Text Citation (Chicago) | HTML Citation | OpenURL
    Social Networking:

    Item Type: Preprint
    Additional Information: forthcoming in Journal of Experimental and Theoretical Artificial Intelligence
    Keywords: artificial agent, representationalism, semantical commitment, semantics, symbol grounding problem
    Subjects: Specific Sciences > Computer Science > Artificial Intelligence
    Depositing User: Luciano Floridi
    Date Deposited: 27 Nov 2005
    Last Modified: 07 Oct 2010 11:13
    Item ID: 2542

    Actions (login required)

    View Item

    Document Downloads