A Praxical Solution of the Symbol Grounding Problem

Taddeo, Mariarosaria and Floridi, Luciano (2008) A Praxical Solution of the Symbol Grounding Problem.

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

Abstract

This article is the second step in our research into the Symbol Grounding Problem
(SGP). In a previous work, we defined the main condition that must be satisfied by any
strategy in order to provide a valid solution to the SGP, namely the zero semantic
commitment condition (Z condition). We then showed that all the main strategies
proposed so far fail to satisfy the Z condition, although they provide several important
lessons to be followed by any new proposal. Here, we develop a new solution of the
SGP. It is called praxical in order to stress the key role played by the interactions
between the agents and their environment. It is based on a new theory of meaning –
Action-based Semantics (AbS) – and on a new kind of artificial agents, called twomachine
artificial agents (AM²). Thanks to their architecture, AM2s implement AbS,
and this allows them to ground their symbols semantically and to develop some fairly
advanced semantic abilities, including the development of semantically grounded
communication and the elaboration of representations, while still respecting the Z
condition.

Keywords:Action-based semantics, artificial evolution, communication, Hebb’s rule, local
selection, Symbol Grounding Problem, two-machine artificial agents, zero semantic
commitment condition.
Subjects:Specific Sciences: Computer Science: Artificial Intelligence
ID Code:4077
Deposited By:Floridi, Luciano
Deposited On:19 June 2008
Additional Information:This is a preprint. The final version was published in Minds and Machines, 2007, 17.4, 369-389.