Theoretical Computer Science - Thirteenth International Colloquim on Automata, Languages and Programming, Renne
Nonmonotonic reasoning, preferential models and cumulative logics
Artificial Intelligence
Propositional knowledge base revision and minimal change
Artificial Intelligence
What does a conditional knowledge base entail?
Artificial Intelligence
Unifying default reasoning and belief revision in a modal framework
Artificial Intelligence
Reasoning about knowledge
Modeling belief in dynamic systems, part I: foundations
Artificial Intelligence
A Textbook of Belief Dynamics: Solutions to Exercises
A Textbook of Belief Dynamics: Solutions to Exercises
Modeling belief in dynamic systems part II: revision and update
Journal of Artificial Intelligence Research
Hi-index | 0.00 |
This paper offers a formalization of iterated belief revision for multiagent communication using the logic of communication graphs introduced in [15]. In this study we consider an agent (i.e., information source) capable of sending two types of message. In the first type, he tells that he knows a proposition, but in the second type, he tells that he believes a proposition. Consequently, iterated belief revision is brought about through a sequence of communication events (i.e., a history ), and we propose a variation of the AGM rational postulates for history based belief revision. As we will show, a representation theorem is verified only for a class of restricted communication graphs. We consider this result to be a weak point in the application of the AGM postulates to multiagent communication, and propose a viable alternative.