Booth, RMeyer, TSombattheera, C2010-04-132010-04-132009-09Booth, R, Meyer, T and Sombattheera, C 2009. General family of preferential belief removal operators. 2nd International Workshop on Logic, Rationality and Interaction (LORI-II), Chongqing, China, 8-11 October 2009, pp 42-54978-3-642-04892-0http://hdl.handle.net/10204/40272nd International Workshop on Logic, Rationality and Interaction (LORI-II), Chongqing, China, 8-11 October 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 the authors generalise the structure of [Booth et al., 2004] to allow incomparabilities between worlds. The authors 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. The authors also look at some alternative notions of epistemic entrenchment which become distinguishable once the authors allow incomparabilities.enBelief removal operatorsBelief removal functionsTransitivityFinite base-generated removalWeak preference principleConference PresentationBooth, R., Meyer, T., & Sombattheera, C. (2009). General family of preferential belief removal operators - [Workshop on LORI-II]. Springer Berlin. http://hdl.handle.net/10204/4027Booth, R, T Meyer, and C Sombattheera. "General family of preferential belief removal operators - [Workshop on LORI-II]." (2009): http://hdl.handle.net/10204/4027Booth R, Meyer T, Sombattheera C, General family of preferential belief removal operators - [Workshop on LORI-II]; Springer Berlin; 2009. http://hdl.handle.net/10204/4027 .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 the authors generalise the structure of [Booth et al., 2004] to allow incomparabilities between worlds. The authors 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. The authors also look at some alternative notions of epistemic entrenchment which become distinguishable once the authors allow incomparabilities. DA - 2009-09 DB - ResearchSpace DP - CSIR KW - Belief removal operators KW - Belief removal functions KW - Transitivity KW - Finite base-generated removal KW - Weak preference principle LK - https://researchspace.csir.co.za PY - 2009 SM - 978-3-642-04892-0 T1 - General family of preferential belief removal operators - [Workshop on LORI-II] TI - General family of preferential belief removal operators - [Workshop on LORI-II] UR - http://hdl.handle.net/10204/4027 ER -