Switch to: Citations

Add references

You must login to add references.
  1. Dynamic Update with Probabilities.Johan van Benthem, Jelle Gerbrandy & Barteld Kooi - 2009 - Studia Logica 93 (1):67 - 96.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   27 citations  
  • A quantitative analysis of modal logic.Ronald Fagin - 1994 - Journal of Symbolic Logic 59 (1):209-252.
    We do a quantitative analysis of modal logic. For example, for each Kripke structure M, we study the least ordinal μ such that for each state of M, the beliefs of up to level μ characterize the agents' beliefs (that is, there is only one way to extend these beliefs to higher levels). As another example, we show the equivalence of three conditions, that on the face of it look quite different, for what it means to say that the agents' (...)
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Dynamic Update with Probabilities.Johan Benthem, Jelle Gerbrandy & Barteld Kooi - 2009 - Studia Logica 93 (1):67-96.
    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 (...)
    Download  
     
    Export citation  
     
    Bookmark   17 citations