这篇 arXiv 论文给信念更新加了选择性机制,能处理部分输入不可信的情况,比旧方法更灵活。
论文提出选择性可信度限制信念更新框架,将复合认知输入按源世界转换为弱代理后再执行可信度限制转移。该框架在语义和公理层面刻画了算子类,并识别出一致性保持与最大一致性保持两个子类。它统一了既有方法:当转换函数取恒等且不设可信度限制时,退化为Katsuno-Mendelzon更新;当不做选择时则恢复为标准可信度限制更新。
Selective Credibility-Limited Belief Update
Belief update concerns changes in an agent's beliefs induced by changes in the underlying world. Standard Katsuno-Mendelzon update assumes that an epistemic input can be incorporated from every initially possible world, whereas credibility-limited belief update restricts, for each source world, the successor worlds regarded as credible or reachable. Nevertheless, existing credibility-limited approaches treat the epistemic input as an indivisible whole, and therefore cannot represent cases in which only part of a compound epistemic input can be realized. We introduce selective credibility-limited belief update, in which the epistemic input is transformed, relative to each source world, into a weaker proxy before the credibility-limited transition is performed. We provide semantic and axiomatic characterizations of the resulting class of update operators. We then identify two well-behaved sub-classes; namely, consistency-preserving update operators, which require every transformed epistemic input to be credible from its source world whenever the original epistemic input is consistent, and maximal consistency-preserving update operators, which additionally require the selected proxy to be maximally informative among the credible consequences of the original epistemic input. Finally, we establish the generality of the proposed framework by showing that credibility-limited belief update is recovered as a special case, while Katsuno--Mendelzon belief update emerges when credibility restrictions are removed and the transformation functions are taken to be identities. These results demonstrate that the framework provides a unified and strictly more expressive account of belief update, encompassing established approaches while supporting source-dependent selective acceptance.