, Volume 93, Issue 1, pp 67-96,
Open Access This content is freely available online to anyone, anywhere at any time.
Date: 17 Sep 2009

Dynamic Update with Probabilities


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.

Presented by Hannes Leitgeb