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.
Visual representation of rational belief revision: another look at the Sleeping Beauty problem