Elementary Iterated Revision and the Levi Identity.

In Proceedings of the 7th International Conference on Logic, Rationality and Interaction (LORI 2019) (forthcoming)
  Copy   BIBTEX

Abstract

Recent work has considered the problem of extending to the case of iterated belief change the so-called `Harper Identity' (HI), which defines single-shot contraction in terms of single-shot revision. The present paper considers the prospects of providing a similar extension of the Levi Identity (LI), in which the direction of definition runs the other way. We restrict our attention here to the three classic iterated revision operators--natural, restrained and lexicographic, for which we provide here the first collective characterisation in the literature, under the appellation of `elementary' operators. We consider two prima facie plausible ways of extending (LI). The first proposal involves the use of the rational closure operator to offer a `reductive' account of iterated revision in terms of iterated contraction. The second, which doesn't commit to reductionism, was put forward some years ago by Nayak et al. We establish that, for elementary revision operators and under mild assumptions regarding contraction, Nayak's proposal is equivalent to a new set of postulates formalising the claim that contraction by ¬A should be considered to be a kind of `mild' revision by A. We then show that these, in turn, under slightly weaker assumptions, jointly amount to the conjunction of a pair of constraints on the extension of (HI) that were recently proposed in the literature. Finally, we consider the consequences of endorsing both suggestions and show that this would yield an identification of rational revision with natural revision. We close the paper by discussing the general prospects for defining iterated revision in terms of iterated contraction.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Extending the Harper Identity to Iterated Belief Change.Jake Chandler & Richard Booth - 2016 - In Subbarao Kambhampati (ed.), Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI). Palo Alto, USA: AAAI Press / International Joint Conferences on Artificial Intelligence.
Iterated Contraction Based on Indistinguishability.Konstantinos Georgatos - 2013 - In Sergei Artemov & Anil Nerode (eds.), LFCS 2013. Springer. pp. 194–205.
The Irreducibility of Iterated to Single Revision.Jake Chandler & Richard Booth - 2017 - Journal of Philosophical Logic 46 (4):405-418.
A framework for iterated revision.Sébastien Konieczny & Ramón Pino Pérez - 2000 - Journal of Applied Non-Classical Logics 10 (3-4):339-367.
Transmission Failure, AGM Style.Jake Chandler - 2013 - Erkenntnis 78 (2):383-398.
Iterated revision and minimal change of conditional beliefs.Craig Boutilier - 1996 - Journal of Philosophical Logic 25 (3):263 - 305.
On the logic of iterated belief revision.Adnan Darwiche & Judea Pearl - 1997 - Artificial Intelligence 89 (1-2):1-29.
Iterated Belief Change and the Recovery Axiom.Samir Chopra, Aditya Ghose, Thomas Meyer & Ka-Shu Wong - 2008 - Journal of Philosophical Logic 37 (5):501-520.

Analytics

Added to PP
2019-07-29

Downloads
53 (#287,268)

6 months
6 (#417,196)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Richard Booth
Cardiff University
Jake Chandler
La Trobe University

Citations of this work

No citations found.

Add more citations

References found in this work

Two modellings for theory change.Adam Grove - 1988 - Journal of Philosophical Logic 17 (2):157-170.
Iterated revision and minimal change of conditional beliefs.Craig Boutilier - 1996 - Journal of Philosophical Logic 25 (3):263 - 305.
Shifting Priorities: Simple Representations for Twenty-seven Iterated Theory Change Operators.Hans Rott - 2009 - In Jacek Malinowski David Makinson & Wansing Heinrich (eds.), Towards Mathematical Philosophy. Springer. pp. 269–296.
What does a conditional knowledge base entail?D. Lehmann & M. Magidor - 1994 - Artificial Intelligence 68 (2):411.
Irrevocable Belief Revision in Dynamic Doxastic Logic.Krister Segerberg - 1998 - Notre Dame Journal of Formal Logic 39 (3):287-306.

View all 13 references / Add more references