ResearchSpace

A general family of preferential belief removal operators

Show simple item record

dc.contributor.author Booth, R
dc.contributor.author Meyer, T
dc.contributor.author Sombattheera, C
dc.date.accessioned 2012-07-26T13:36:25Z
dc.date.available 2012-07-26T13:36:25Z
dc.date.issued 2012-05
dc.identifier.citation Booth, R, Meyer, T and Sombattheera, C. 2012. A general family of preferential belief removal operators. Journal of Philosophical Logic, vol. 41(4), pp 711-733 en_US
dc.identifier.issn 0022-3611
dc.identifier.uri http://www.springerlink.com/content/f6368324072g3344/
dc.identifier.uri http://www.springerlink.com/content/f6368324072g3344/fulltext.pdf
dc.identifier.uri http://hdl.handle.net/10204/6012
dc.description Copyright: 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-733 en_US
dc.description.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. en_US
dc.language.iso en en_US
dc.publisher Springer en_US
dc.relation.ispartofseries Workflow;9304
dc.subject Belief revision en_US
dc.subject Belief removal en_US
dc.subject Belief contraction en_US
dc.subject Belief change en_US
dc.subject Plausibility orderings en_US
dc.subject Finite belief bases en_US
dc.title A general family of preferential belief removal operators en_US
dc.type Article en_US
dc.identifier.apacitation Booth, R., Meyer, T., & Sombattheera, C. (2012). A general family of preferential belief removal operators. http://hdl.handle.net/10204/6012 en_ZA
dc.identifier.chicagocitation Booth, R, T Meyer, and C Sombattheera "A general family of preferential belief removal operators." (2012) http://hdl.handle.net/10204/6012 en_ZA
dc.identifier.vancouvercitation Booth R, Meyer T, Sombattheera C. A general family of preferential belief removal operators. 2012; http://hdl.handle.net/10204/6012. en_ZA
dc.identifier.ris 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 - en_ZA


Files in this item

Thumbnail
Name: Meyer1_2012.pdf
Size: 469.3Kb
Format: PDF
View/Open

This item appears in the following Collection(s)

Show simple item record