Abstract
The standard semantics of multi-agent epistemic logic S5n is based on Kripke models whose accessibility relations are reflexive, symmetric and transitive. This one dimensional structure contains implicit higher-dimensional information beyond pairwise interactions, that we formalized as pure simplicial models in a previous work in Information and Computation 2021 [10]. Here we extend the theory to encompass simplicial models that are not necessarily pure. The corresponding class of Kripke models are those where the accessibility relation is symmetric and transitive, but might not be reflexive. Such models correspond to the epistemic logic KB4n. Impure simplicial models arise in situations where two possible worlds may not have the same set of agents. We illustrate it with distributed computing examples of synchronous systems where processes may crash.
Original language | English |
---|---|
Title of host publication | 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022) |
Editors | Petra Berenbrink, Benjamin Monmege |
Place of Publication | Dagstuhl, Germany |
Pages | 33:1--33:20 |
Number of pages | 20 |
Volume | 219 |
ISBN (Electronic) | 9783959772228 |
DOIs | |
Publication status | Published - 18 Mar 2022 |
Event | 39th International Symposium on Theoretical Aspects of Computer Science - Marseille, France Duration: 15 Mar 2022 → 18 Mar 2022 https://stacs2022.sciencesconf.org/ |
Publication series
Name | Leibniz International Proceedings in Informatics, LIPIcs |
---|---|
Volume | 219 |
ISSN (Print) | 1868-8969 |
Conference
Conference | 39th International Symposium on Theoretical Aspects of Computer Science |
---|---|
Country/Territory | France |
City | Marseille |
Period | 15/03/22 → 18/03/22 |
Internet address |
Keywords
- epistemic logic
- simplicial complexes
- distributed computing