Propositional belief base update and minimal change
Artificial Intelligence
On the logic of iterated belief revision
TARK '94 Proceedings of the 5th conference on Theoretical aspects of reasoning about knowledge
Modeling belief in dynamic systems part II: revision and update
Journal of Artificial Intelligence Research
Revision sequences and nested conditionals
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Reasoning about persistence: a theory of actions
IJCAI'93 Proceedings of the 13th international joint conference on Artifical intelligence - Volume 1
Updates, actions, and planning
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Iterated theory base change: a computational model
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Generalized update: belief change in dynamic settings
IJCAI'95 Proceedings of the 14th international joint conference on Artificial intelligence - Volume 2
Iterated belief change in the situation calculus
Artificial Intelligence
Propositional independence: formula-variable independence and forgetting
Journal of Artificial Intelligence Research
Propositional Update Operators Based on Formula/Literal Dependence
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
Belief update is usually defined by means of operators acting on belief sets. We propose here belief update operators acting on epistemic states which convey much more information than belief sets since they express the relative plausibilities of the pieces of information believed by the agent. In the following, epistemic states are encoded as rankings on worlds. We extend a class of update operators (dependency-based updates) to epistemic states, by defining an operation playing the same role as knowledge transmutations [21] do for belief revision.