General patterns in nonmonotonic reasoning
Handbook of logic in artificial intelligence and logic programming (vol. 3)
On the logic of iterated belief revision
Artificial Intelligence
Updating with belief functions, ordinal conditional functions and possibility measures
UAI '90 Proceedings of the Sixth Annual Conference on Uncertainty in Artificial Intelligence
Three Scenarios for the Revision of Epistemic States*
Journal of Logic and Computation
Ordinal and probabilistic representations of acceptance
Journal of Artificial Intelligence Research
Revision sequences and nested conditionals
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
On the revision of probabilistic beliefs using uncertain evidence
Artificial Intelligence
Hi-index | 0.00 |
Intelligent agents require methods to revise their epistemic state as they acquire new information. Jeffrey's rule, which extends conditioning to uncertain inputs, is currently used for revising probabilistic epistemic states when new information is uncertain. This paper analyses the expressive power of two possibilistic counterparts of Jeffrey's rule for modeling belief revision in intelligent agents. We show that this rule can be used to recover most of the existing approaches proposed in knowledge base revision, such as adjustment, natural belief revision, drastic belief revision, revision of an epistemic by another epistemic state. In addition, we also show that that some recent forms of revision, namely improvement operators, can also be recovered in our framework.