检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:张洋 ZHANG Yang(School of Marxism,South China University of Technology,Guangzhou 510640,China)
机构地区:[1]华南理工大学马克思主义学院,广东广州510640
出 处:《系统科学学报》2023年第3期29-34,共6页Chinese Journal of Systems Science
摘 要:符号奠基问题的核心是要设法使符号具有关联于外部世界的意义。随着过去解决方案的接连失败,该问题的框架也在反思中得到了不断完善,其中就包括“零语义承诺条件”和“错误表征条件”的提出。然而在实际的研发过程中,零语义承诺条件却一直难以得到贯彻;不仅如此,尽管错误表征条件要求智能体能够自主识别并修正表征的错误,但来自外部的评估始终却都是一个不可避免的要素。因此,我们有理由怀疑在严格的零语义承诺条件与错误表征条件之间存在着不兼容性,有必要考虑适当放宽前者对符号奠基问题的约束。The symbol grounding problem(SGP) can be roughly expressed as:how to enable an agent to give symbols semantic content by its own mechanism without relying on external observer.With the successive failures of past solutions,the framework of SGP has also been continuously improved in reflection,which includs the addition of “zero semantical commitment condition”(ZSCC) and “misrepresentation condition”(MC).However,in actual research,the ZSCC is found difficult to obey.Not only that,when the ability of misrepresentation requires that the agent can identify and correct from representational errors automatically,external evaluation standards are always indispensable,thus breach the ZSCC.So it can be concluded that the strict ZSCC is incompatible with the MC,and therefore it is necessary to appropriately relax the former's constraints on the SGP.
关 键 词:符号奠基问题 零语义承诺条件 错误表征 指称的因果理论
分 类 号:N941[自然科学总论—系统科学]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.15