Name
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. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1007/s11225-009-9209-y | Studia Logica - An International Journal for Symbolic Logic |
Keywords | Field | DocType |
probability,dynamic epistemic logic,update,Jeffrey’s rule | T-norm fuzzy logics,Computer science,Probabilistic logic network,Substructural logic,Algorithm,Probabilistic CTL,Theoretical computer science,Classical logic,Probabilistic argumentation,Probabilistic logic,Many-valued logic | Journal |
Volume | Issue | Citations |
93 | 1 | 24 |
PageRank | References | Authors |
1.24 | 13 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Johan van Benthem | 1 | 1181 | 107.83 |
| Jelle Gerbrandy | 2 | 253 | 20.40 |
| Barteld P. Kooi | 3 | 477 | 35.43 |