Graduate studies at Western
Studia Logica 93 (1):67-96 (2009)
|Abstract||Current dynamic-epistemic logics model different types of information change in multi-agent scenarios. We generalize these logics to a probabilistic setting, obtaining a calculus for multi-agent update with three natural slots: prior probability on states, occurrence probabilities in the relevant process taking place, and observation probabilities of events. To match this update mechanism, we present a complete dynamic logic of information change with a probabilistic character. The completeness proof follows a compositional methodology that applies to a much larger class of dynamic-probabilistic logics as well. Finally, we discuss how our basic update rule can be parameterized for different update policies, or learning methods.|
|Keywords||probability dynamic epistemic logic update Jeffrey’s rule|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Jan Van Eijck & Fer-Jan De Vries (1995). Reasoning About Update Logic. Journal of Philosophical Logic 24 (1):19 - 45.
Cédric Dégremont & Nina Gierasimczuk (2011). Finite Identification From the Viewpoint of Epistemic Update. Information And Computation 209 (3):383-396.
Joshua Sack (2009). Extending Probabilistic Dynamic Epistemic Logic. Synthese 169 (2):241 - 257.
Johan van Benthem (2007). Dynamic Logic for Belief Revision. Journal of Applied Non-Classical Logics 17 (2):129-155.
Johan van Benthem (2003). Conditional Probability Meets Update Logic. Journal of Logic, Language and Information 12 (4):409-421.
Added to index2009-09-21
Total downloads30 ( #46,402 of 739,304 )
Recent downloads (6 months)1 ( #61,243 of 739,304 )
How can I increase my downloads?