Title
A General Family of Preferential Belief Removal Operators
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 [5]. However it is not always reasonable to assume completeness of the underlying ordering. In this paper we generalise the structure of [5] 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.
Year
DOI
Venue
2012
10.1007/978-3-642-04893-7_4
J. Philosophical Logic
Keywords
DocType
Volume
nonmonotonic reasoning,belief revision,possible worlds
Journal
41
Issue
ISSN
ISBN
4
1573-0433
3-642-04892-7
Citations 
PageRank 
References 
1
0.36
21
Authors
3
Name
Order
Citations
PageRank
Richard Booth1261.37
Thomas Meyer224020.99
Chattrakul Sombattheera3306.87