Andersen, Mikkel Birkegaard2; Bolander, Thomas1; van Ditmarsch, H.3; Jensen, Martin Holm4
1 Department of Applied Mathematics and Computer Science, Technical University of Denmark2 Algorithms and Logic, Department of Applied Mathematics and Computer Science, Technical University of Denmark3 Université de Lorraine4 Department of Informatics and Mathematical Modeling, Technical University of Denmark
Epistemic plausibility models are Kripke models agents use to reason about the knowledge and beliefs of themselves and each other. Restricting ourselves to the single-agent case, we determine when such models are indistinguishable in the logical language containing conditional belief, i.e., we define a proper notion of bisimulation, and prove that bisimulation corresponds to logical equivalence on image-finite models. We relate our results to other epistemic notions, such as safe belief and degrees of belief. Our results imply that there are only finitely many non-bisimilar single-agent epistemic plausibility models on a finite set of propositions. This gives decidability for single-agent epistemic plausibility planning.
Lecture Notes in Computer Science: 26th Australasian Joint Conference, Dunedin, New Zealand, December 1-6, 2013. Proceedings, 2013, p. 277-288
Main Research Area:
Lecture Notes in Computer Science
6th Australasian Joint Conference on Artificial Intelligence (AI 2013)Australasian Joint Conference on Artificial Intelligence