Booth, RMeyer, TSombattheera, C2010-01-152010-01-152009-07Booth, R, Meyer, T and Sombattheera, C. 2009. General family of preferential belief removal operators. 8th International Workshop on Nonmonotonic Reasoning, Action and Change. Pasadena, California, USA, 11 - 17 July 2009, pp 1-8http://hdl.handle.net/10204/38908th International Workshop on Nonmonotonic Reasoning, Action and Change. Pasadena, California, USA, 11 - 17 July 2009Most 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., 2004). However it is not always reasonable to assume completeness of the underlying ordering. In this paper researchers generalise the structure of [Booth et al., 2004] to allow incomparabilities between worlds. Researchers 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. This paper also looks at some alternative notions of epistemic entrenchment which become distinguishable once we allow incomparabilitiesenBelief removal operatorsBelief removal functionsEpistemic entrenchmentFinite base-generated removalAGM preferential removalNonmonotonic reasoning8th International Workshop on Nonmonotonic Reasoning, Action and ChangeConference PresentationBooth, R., Meyer, T., & Sombattheera, C. (2009). General family of preferential belief removal operators. http://hdl.handle.net/10204/3890Booth, R, T Meyer, and C Sombattheera. "General family of preferential belief removal operators." (2009): http://hdl.handle.net/10204/3890Booth R, Meyer T, Sombattheera C, General family of preferential belief removal operators; 2009. http://hdl.handle.net/10204/3890 .TY - Conference Presentation 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., 2004). However it is not always reasonable to assume completeness of the underlying ordering. In this paper researchers generalise the structure of [Booth et al., 2004] to allow incomparabilities between worlds. Researchers 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. This paper also looks at some alternative notions of epistemic entrenchment which become distinguishable once we allow incomparabilities DA - 2009-07 DB - ResearchSpace DP - CSIR KW - Belief removal operators KW - Belief removal functions KW - Epistemic entrenchment KW - Finite base-generated removal KW - AGM preferential removal KW - Nonmonotonic reasoning KW - 8th International Workshop on Nonmonotonic Reasoning, Action and Change LK - https://researchspace.csir.co.za PY - 2009 T1 - General family of preferential belief removal operators TI - General family of preferential belief removal operators UR - http://hdl.handle.net/10204/3890 ER -