AAAI Publications, Thirteenth International Conference on the Principles of Knowledge Representation and Reasoning

Font Size: 
Credibility-Limited Revision Operators in Propositional Logic
Richard Booth, Eduardo Fermé, Sébastien Konieczny, Ramon Pino Pérez

Last modified: 2012-05-17


In Belief Revision the new information is generally accepted, following the principle of primacy of update. In some case this behavior can be criticized and one could require that some new pieces of information can be rejected by the agent because, for instance, of insufficient plausibility. This has given rise to several approaches of non-prioritized Belief Revision. In particular (Hansson et al. 2001) defined credibility-limited revision operators, where a revision is accepted only if the new information is a formula that belongs to a set of credible formulas. They provide several representation theorems in the AGM style. In this work we study credibility-limited revision operators when the information is represented in propositional logic, like in the Katsuno and Mendelzon framework. We propose a set of postulates and a representation theorem for credibility-limited revision operators. Then we explore how to generalize these definitions to the Iterated Belief Revision case, using epistemic states in the Darwiche and Pearl style.


belief revision; iterated revision;

Full Text: PDF