On Belief Promotion.

We introduce a new class of belief change operators, named promotion operators. The aim of these operators is to enhance the acceptation of a formula representing a new piece of information. We give postulates for these operators and provide a representation theorem in terms of minimal change. We also show that this class of operators is a very general one, since it captures as particular cases belief revision, commutative revision, and (essentially) belief contraction.