About

Log in?

DTU users get better search results including licensed content and discounts on order fees.

Anyone can log in and get personalized features such as favorites, tags and feeds.

Log in as DTU user Log in as non-DTU user No thanks

DTU Findit

Conference paper

Bisimulation for Single-Agent Plausibility Models

From

Department of Applied Mathematics and Computer Science, Technical University of Denmark1

Algorithms and Logic, Department of Applied Mathematics and Computer Science, Technical University of Denmark2

Université de Lorraine3

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.

Language: English
Publisher: Springer
Year: 2013
Pages: 277-288
Proceedings: 6th Australasian Joint Conference on Artificial Intelligence (AI 2013)Australasian Joint Conference on Artificial Intelligence
Series: Lecture Notes in Computer Science
Journal subtitle: 26th Australasian Joint Conference, Dunedin, New Zealand, December 1-6, 2013. Proceedings
ISBN: 3319036793 , 3319036807 , 9783319036793 and 9783319036809
ISSN: 03029743
Types: Conference paper
DOI: 10.1007/978-3-319-03680-9_30
ORCIDs: Bolander, Thomas

DTU users get better search results including licensed content and discounts on order fees.

Log in as DTU user

Access

Analysis