Solving the symbol grounding problem: a critical review of fifteen years of research

Download Edit this record How to cite View on PhilPapers
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
PhilPapers/Archive ID
TADSTS
Upload history
Archival date: 2021-06-09
View other versions
Added to PP index
2009-01-28

Total views
120 ( #38,261 of 2,432,329 )

Recent downloads (6 months)
7 ( #52,753 of 2,432,329 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.