Constructive models for contraction with intransitive plausibility indifference

Publisher:
Springer Verlag
Publication Type:
Conference Proceeding
Citation:
Logics in Artificial Intelligence - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8761 pp. 355 - 367
Issue Date:
2014
Full metadata record
Files in This Item:
Filename Description Size
ThumbnailPeppas_Williams.pdf Published version159.92 kB
Adobe PDF
Plausibility rankings play a central role in modeling Belief Change, and they take different forms depending on the type of belief change under consideration: preorders on possible worlds, epistemic entrenchments, etc. A common feature of all these structures is that plausibility indifference is assumed to be transitive. In a previous article, [7], we argued that this is not always the case, and we introduced new sets of postulates for revision and contraction (weaker variants of the classical AGM postulates), that are liberated from the indifference transitivity assumption. Herein we complete the task by making the necessary adjustments to the epistemic entrenchment and the partial meet models. In particular we lift the indifference transitivity assumption from both these two models, and we establish representation results connecting the weaker models with the weaker postulates for contraction introduced in [7].
Please use this identifier to cite or link to this item: