Decrement Operators in Belief Change

by   Kai Sauerwald, et al.
FernUniversität in Hagen

While research on iterated revision is predominant in the field of iterated belief change, the class of iterated contraction operators received more attention in recent years. In this article, we examine a non-prioritized generalisation of iterated contraction. In particular, the class of weak decrement operators is introduced, which are operators that by multiple steps achieve the same as a contraction. Inspired by Darwiche and Pearl's work on iterated revision the subclass of decrement operators is defined. For both, decrement and weak decrement operators, postulates are presented and for each of them a representation theorem in the framework of total preorders is given. Furthermore, we present two types of decrement operators which have a unique representative.


page 1

page 2

page 3

page 4


A Conditional Perspective for Iterated Belief Contraction

According to Boutillier, Darwiche, Pearl and others, principles for iter...

Lagrange approximation of transfer operators associated with holomorphic data

We show that spectral data of transfer operators given by holomorphic da...

On Mixed Iterated Revisions

Several forms of iterable belief change exist, differing in the kind of ...

System of Spheres-based Two Level Credibility-limited Revisions

Two level credibility-limited revision is a non-prioritized revision ope...

Elementary Iterated Revision and the Levi Identity

Recent work has considered the problem of extending to the case of itera...

A Formalization of Unique Solutions of Equations in Process Algebra

In this thesis, a comprehensive formalization of Milner's Calculus of Co...

Unique Solutions of Contractions, CCS, and their HOL Formalisation

The unique solution of contractions is a proof technique for bisimilarit...

Please sign up or login with your details

Forgot password? Click here to reset