Reference : A general family of preferential belief removal operators
Scientific journals : Article
Engineering, computing & technology : Computer science
A general family of preferential belief removal operators
Booth, Richard mailto [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC) >]
Meyer, Thomas [CSIR Meraka Institute, Pretoria, South Africa]
Sombattheera, Chattrakul [Mahasarakham University, Thailand]
Journal of Philosophical Logic
Yes (verified by ORBilu)
[en] Belief revision ; Belief removal ; Belief contraction ; Belief change ; Plausibility orderings ; Finite belief bases
[en] 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.

File(s) associated to this reference

Fulltext file(s):

Limited access
Journal of Philosophical Logic 2012 Booth.pdfPublisher postprint511.55 kBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.