We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
A General Family of Preferential Belief Removal Operators.
- Authors
Booth, Richard; Meyer, Thomas; Sombattheera, Chattrakul
- 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, ). 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, ) 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.
- Subjects
BELIEF sentences (Logic); PLAUSIBILITY (Logic); BELIEF change; COMPLETENESS theorem; AXIOMS; OPERATOR theory
- Publication
Journal of Philosophical Logic, 2012, Vol 41, Issue 4, p711
- ISSN
0022-3611
- Publication type
Article
- DOI
10.1007/s10992-012-9235-5