Beliefs, belief revision, and splitting languages
Logic, language and computation, vol. 2
Relevance sensitive belief structures
Annals of Mathematics and Artificial Intelligence
Studia Logica
| Hi-index | 0.00 |
Contractions on belief sets that have no finite representation cannot be finite in the sense that only a finite number of sentences is removed. However, such contractions can be delimited so that the actual change takes place in a logically isolated, finite-based part of the belief set. A construction that answers to this principle is introduced, and is axiomatically characterized. It turns out to coincide with specified meet contraction.