Booth, RMeyer, TSombattheera, C2012-07-262012-07-262012-05Booth, R, Meyer, T and Sombattheera, C. 2012. A general family of preferential belief removal operators. Journal of Philosophical Logic, vol. 41(4), pp 711-7330022-3611http://www.springerlink.com/content/f6368324072g3344/http://www.springerlink.com/content/f6368324072g3344/fulltext.pdfhttp://hdl.handle.net/10204/6012Copyright: 2012 Springer. This is the post-print version of the work. The definitive version is published in Journal of Philosophical Logic, vol. 41(4), pp 711-733Most 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.enBelief revisionBelief removalBelief contractionBelief changePlausibility orderingsFinite belief basesArticleBooth, R., Meyer, T., & Sombattheera, C. (2012). A general family of preferential belief removal operators. http://hdl.handle.net/10204/6012Booth, R, T Meyer, and C Sombattheera "A general family of preferential belief removal operators." (2012) http://hdl.handle.net/10204/6012Booth R, Meyer T, Sombattheera C. A general family of preferential belief removal operators. 2012; http://hdl.handle.net/10204/6012.TY - Article AU - Booth, R AU - Meyer, T AU - Sombattheera, C AB - 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. DA - 2012-05 DB - ResearchSpace DP - CSIR KW - Belief revision KW - Belief removal KW - Belief contraction KW - Belief change KW - Plausibility orderings KW - Finite belief bases LK - https://researchspace.csir.co.za PY - 2012 SM - 0022-3611 T1 - A general family of preferential belief removal operators TI - A general family of preferential belief removal operators UR - http://hdl.handle.net/10204/6012 ER -