Download PDFOpen PDF in browser

Iterated contraction of propositions and conditionals under the principle of conditional preservation

15 pagesPublished: October 19, 2017

Abstract

Research on iterated belief change has focussed mostly on belief revision, only few papers have addressed iterated belief contraction. Most prominently, Darwiche and Pearl published seminal work on iterated belief revision the leading paradigm of which is the so-called principle of conditional preservation. In this paper, we use this principle in a thoroughly axiomatized form to develop iterated belief contraction operators for Spohn's ranking functions. We show that it allows for setting up constructive approaches to tackling the problem of how to contract a ranking function by a proposition or a conditional, respectively, and that semantic principles can also be derived from it for the purely qualitative case.

Keyphrases: conditional preservation, iterated belief change, iterated contraction, ranking functions

In: Christoph Benzmüller, Christine Lisetti and Martin Theobald (editors). GCAI 2017. 3rd Global Conference on Artificial Intelligence, vol 50, pages 78-92.

BibTeX entry
@inproceedings{GCAI2017:Iterated_contraction_propositions_conditionals,
  author    = {Gabriele Kern-Isberner and Tanja Bock and Kai Sauerwald and Christoph Beierle},
  title     = {Iterated contraction of propositions and conditionals under the principle of conditional preservation},
  booktitle = {GCAI 2017. 3rd Global Conference on Artificial Intelligence},
  editor    = {Christoph Benzmüller and Christine Lisetti and Martin Theobald},
  series    = {EPiC Series in Computing},
  volume    = {50},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/DTmX},
  doi       = {10.29007/3q8l},
  pages     = {78-92},
  year      = {2017}}
Download PDFOpen PDF in browser