检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:刘勇[1] 蒲树祯[2] 程代杰[3] 曹泽翰[3]
机构地区:[1]电子科技大学计算机科学与工程学院,成都610054 [2]重庆交通学院计算机科学与技术系,重庆400074 [3]重庆大学计算机学院,重庆400044
出 处:《计算机研究与发展》2005年第1期54-59,共6页Journal of Computer Research and Development
基 金:国防预研基金项目(06297003)
摘 要:Agent计算的典型模型是BDI(belief,desire,intention),信念是Agent计算的重要属性.把信念拓展为知识性信念和可实现信念.Agent的知识性信念是指Agent当前具有或掌握的知识,具有知识的进化和继承特性.Agent的可实现信念是指当前不成立而在将来会成立的事情,是Agent被意识到的个性倾向和目标.用非标准世界的模态逻辑为形式化工具描述两种信念,将可能世界的可达关系作为认识的不同阶段和达到可实现信念的不同阶段,避免了"逻辑全知问题"和逻辑蕴涵的副作用问题.可实现信念满足KD公理,知识性信念满足KDT4公理.两种信念适合描述Agent的意识状态和意识模型.Typical model of agent computing is BDI (belief, desire and intention), in which the belief is an important attribute. In this paper, the belief is extended into knowledge belief and achieving belief. Knowledge belief stands for the knowledge an agent has, which has the characteristics of knowledge evolving and inheriting. Achievement belief stands for an event which is not achieved now but will be achieved in future. It is the personality or goal which is awared by agent. Describing these two kinds of belives by the modal logic formalizing tools in non-standard world, the reachable relationship in possible world can be described as the different phases of cognition and of belief realization. This avoids the logical omniscience problem and the logical side effect problem. Knowledge belief satisfies the KDT4 axioms, and achievement belief satisfies KD axioms. These two kind of believes can be used in mental state and mental model describing.
分 类 号:TP18[自动化与计算机技术—控制理论与控制工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.145.201.156