人工智能中符号奠基问题的几种解决策略  

The Symbol Grounding Problem:Strategies from Cognitivism to Semiotics

作　　者：毛郝浩 李建会 MAO Haohao;LI Jianhui

机构地区：[1]北京师范大学哲学学院

出　　处：《哲学分析》2022年第1期31-44,196,197,共16页Philosophical Analysis

基　　金：教育部人文社会科学研究重大课题攻关项目“人工智能的哲学思考研究”(项目编号:18JZD013);广东省普通高校重点领域专项项目。

摘　　要：符号奠基问题(Symbol Grounding Problem:SGP)是人工智能中的一个重要理论问题。它由认知科学家哈纳德提出,意指在不借助外部中介的条件下,一个纯粹的符号系统应如何获取意义?目前为止,SGP的解决方案主要有三种:第一,以哈纳德的杂合系统为代表的认知主义方案;第二,以布鲁克斯的物理奠基策略为代表的生成主义方案;第三,以福格特等人为代表的指号学方案。但是,这些解决方案都受到了塔迪欧和弗洛里迪的批评。他们提出了“零语义承诺”,即要求这些方案不能借助任何形式的内在主义(innatism)和外在主义(externalism)解决SGP问题。不过,“零语义承诺”本身也存在诸多问题,其合理性仍需进一步阐明。The Symbol Grounding Problem(SGP)is an important theoretical problem.Proposed by StevenHarnad,it aims to explain how a formal symbolic system can obtain meaning without an external mediation.So far there exist three main strategies:(1)cognitivism represented by Harnad’s hybrid system;(2)enactivism represented by Rodney Brooks’s physical grounding strategy;and(3)semiotics strategy represented by PaulVogt.However,these strategies are faced with criticisms from Mariarosaria Taddeo and Luciano Floridi.Theyproposed“zero semantic commitment”,which requires them to solve the SGP without any form of innatismand externalism.Yet,the reasonableness of“zero semantic commitment”which itself has problems needs to be further clarified.

关 键 词：符号奠基问题 人工智能 中文屋论证 

分 类 号：B80[哲学宗教—思维科学]