Journal of Philosophical Logic

, Volume 41, Issue 4, pp 711–733

A General Family of Preferential Belief Removal Operators

Authors

    • University of Luxembourg
  • Thomas Meyer
    • Centre for Artificial Intelligence ResearchUniversity of KwaZulu-Natal and CSIR Meraka
  • Chattrakul Sombattheera
    • Mahasarakham University
Article

DOI: 10.1007/s10992-012-9235-5

Cite this article as:
Booth, R., Meyer, T. & Sombattheera, C. J Philos Logic (2012) 41: 711. doi:10.1007/s10992-012-9235-5

Abstract

Most belief change operators in the AGM tradition assume an underlying plausibility ordering over the possible worlds which is transitive and complete. A unifying structure for these operators, based on supplementing the plausibility ordering with a second, guiding, relation over the worlds was presented in Booth et al. (Artif Intell 174:1339–1368, 2010). However it is not always reasonable to assume completeness of the underlying ordering. In this paper we generalise the structure of Booth et al. (Artif Intell 174:1339–1368, 2010) to allow incomparabilities between worlds. We axiomatise the resulting class of belief removal functions, and show that it includes an important family of removal functions based on finite prioritised belief bases.

Keywords

Belief revision Belief removal Belief contraction Belief change Plausibility orderings Finite belief bases

Copyright information

© Springer Science+Business Media B.V. 2012