Iterated Contraction Based on Indistinguishability

In Sergei Artemov & Anil Nerode, LFCS 2013. Springer. pp. 194–205 (2013)
  Copy   BIBTEX

Abstract

We introduce a class of set-theoretic operators on a tolerance space that models the process of minimal belief contraction, and therefore a natural process of iterated contraction can be defined. We characterize the class of contraction operators and study the properties of the associated iterated belief contraction.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 107,589

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, Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI). Palo Alto, USA: AAAI Press / International Joint Conferences on Artificial Intelligence.
Threshold-Based Belief Change.Eric Raidl & Hans Rott - 2023 - Australasian Journal of Logic 20 (3):429-477.
Elementary Belief Revision Operators.Jake Chandler & Richard Booth - 2023 - Journal of Philosophical Logic 52 (1):267-311.
Coherentist Contraction.Sven Ove Hansson - 2000 - Journal of Philosophical Logic 29 (3):315 - 330.
Kernel contraction.Sven Ove Hansson - 1994 - Journal of Symbolic Logic 59 (3):845-859.

Analytics

Added to PP
2013-12-15

Downloads
25 (#1,049,321)

6 months
2 (#1,532,513)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Konstantinos Georgatos
City University of New York

Citations of this work

Geodesic merging.Konstantinos Georgatos - 2018 - Synthese 195 (10):4243-4264.

Add more citations