Abstract

Rational belief-change policies are encoded in the so-called AGM revision functions, defined in the prominent work of Alchourrón, Gärdenfors and Makinson. The present article studies an interesting class of well-behaved AGM revision functions, called herein uniform-revision operators (or UR operators, for short). Each UR operator is uniquely defined by means of a single total preorder over all possible worlds, a fact that in turn entails a significantly lower representational cost, relative to an arbitrary AGM revision function, and an embedded solution to the iterated-revision problem, at no extra representational cost. Herein, we first demonstrate how weaker, more expressive—yet, more representationally expensive—types of uniform revision can be defined. Furthermore, we prove that UR operators, essentially, generalize a significant type of belief change, namely, parametrized-difference revision. Lastly, we show that they are (to some extent) relevance-sensitive, as well as that they respect the so-called principle of kinetic consistency.

中文翻译：

---

关于统一信仰修订

摘要

理性的信念改变政策编码在所谓的AGM修订功能中，该功能在Alchourrón，Gärdenfors和Makinson的杰出著作中定义。本文研究了一种有趣的行为良好的AGM修订功能，在此称为统一修订运算符（简称UR运算符）。每个UR运营商都是通过所有可能世界中的单个总预购来唯一定义的，这一事实反过来相对于任意的AGM修订功能而言，其代表成本要低得多，并且在迭代修订问题中存在嵌入式解决方案。没有额外的代表费用。在这里，我们首先说明如何定义统一修订的较弱，更具表现力（但又更具代表性）的类型。此外，我们证明了UR运算符从本质上讲 归纳出一种重要的信念变化类型，即参数化差异修订。最后，我们证明它们在某种程度上对关联敏感，并且它们尊重所谓的动力学一致性原理。