The Consistency Argument for Ranking Functions
The Consistency Argument for Ranking Functions
复制标题
排名函数的一致性论证
DOI：
10.1007/s11225-007-9062-9
复制
发表时间：
2007
期刊：
影响因子：
0.7
通讯作者：
F. Huber
中科院分区：
文献类型：
--
作者：
F. Huber
本文为agent的不信度服从排序演算这一命题提供了论证。这个一致性论证是基于一致性定理的。后者认为，智能体的信念集是一致的，演绎封闭的，前提是它的防御程度满足排序公理，并根据秩论更新规则进行更新。
The paper provides an argument for the thesis that an agent’s degrees of disbelief should obey the ranking calculus. This Consistency Argument is based on the Consistency Theorem. The latter says that an agent’s belief set is and will always be consistent and deductively closed iff her degrees of entrenchment satisfy the ranking axioms and are updated according to the ranktheoretic update rules.