用更灵活的序关系建模信念更新,处理信息可信度与矛盾冲突。
Interval Orders, Biorders and Credibility-limited Belief Revision

- 引入区间序和双序刻画世界可接受性,突破传统全序限制。
- 双序更新可保持一致性但不保证成功接收新信息。
- 适合处理信息需解释才可信的场景,如人类认知决策。
理性信念更新通常基于可能世界间的偏好序,新信念集由新信息中最优模型中为真的命题构成。传统上偏好序为全序预序,但本文探讨两种更广义的序结构:鱼翁(Fishburn)提出的区间序,为每个可能世界分配非负可信任区间;以及阿列舍罗夫等研究的双序,允许区间长度为负,可捕捉不协调或不稳定感。本文对这两类信念更新算子给出了公理化刻画,并分析了其介于二者之间的两类变体。发现双序更新虽满足成功性,但未必输出一致信念;通过剔除导致不一致的输入(称为‘不可信’),构造出非优先级更新族,满足一致性但不满足成功性。这些算子与汉森等人的可信度受限更新相关,但其可信句子集不满足单句封闭性。我们主张双序方法适用于初始拒绝信息、经解释后才接受的情境。
原文摘要 · Abstract (English)
Rational belief revision is commonly viewed as being based on a preference order between possible worlds, with the resulting new belief set being those sentences true in all the most preferred models of the incoming new information. Usually, such a preference order is taken to be a total preorder. Nevertheless, there are other, more general classes of ordering that can also be employed. In this paper, we explore two such classes that have been studied within the theory of rational choice but have seen limited or no application in belief revision. We begin with interval orders, introduced by Fishburn in the '80s, which associate with each possible world a nonnegative `interval' of plausibility. We then move on to biorders, studied by Aleskerov, Bouyssou, and Monjardet, which generalise interval orders by allowing the intervals to have negative lengths, a feature that can be used to capture a notion of dissonance or instability. We provide axiomatic characterisations of these two resulting families of belief revision operators, as well as of two further families of interest that lie between interval orders and biorders. We show that while biorder-based revisions satisfy the Success postulate, they do not always yield consistent outputs. By modifying their definition to discard inputs that lead to inconsistency as `incredible', we derive new families of so-called non-prioritised revision that satisfy the Consistency postulate, but not the Success one. These families are linked to credibility-limited revision operators of Hansson et al., but for which the set of credible sentences does not satisfy the single-sentence closure condition. We argue that the biorder-based approach is well-suited for scenarios where an agent might initially reject new information, but may accept it when presented with additional explanation.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。