GROUNDING LANGUAGES IN COGNITIVE AGENTS AND ROBOTS

摘要

The symbol grounding problem is discussed for the case of simple language of formulas with modal operators and the cognitive agent. The language formulas are built from modal operators and logical connectives of conjunction, disjunction and exclusive disjunction. The cognitive agent carries out perceptions of an external world and stores their content in dedicated temporal database. The empirical experience contained in this database defines the scope of possible meaning that can ever be assigned to belief formulas. Two close but different approaches to implementing the idea of grounding in cognitive structures of the agent are presented.