DSpace
 

Researchspace >
General science, engineering & technology >
General science, engineering & technology >
General science, engineering & technology >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10204/4027

Title: General family of preferential belief removal operators - [Workshop on LORI-II]
Authors: Booth, R
Meyer, T
Sombattheera, C
Keywords: Belief removal operators
Belief removal functions
Transitivity
Finite base-generated removal
Weak preference principle
Issue Date: Sep-2009
Publisher: Springer Berlin
Citation: Booth, 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-54
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., 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.
Description: 2nd International Workshop on Logic, Rationality and Interaction (LORI-II), Chongqing, China, 8-11 October 2009
URI: http://hdl.handle.net/10204/4027
ISBN: 978-3-642-04892-0
Appears in Collections:Digital intelligence
General science, engineering & technology

Files in This Item:

File Description SizeFormat
Booth_2009.pdf182.01 kBAdobe PDFView/Open
View Statistics

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback