Abstract
Coalition logic is currently one of the most popular logics for multi-agent systems. While logics combining coalitional and epistemic operators have received considerable attention, completeness results for epistemic extensions of coalition logic have so far been missing. In this paper we provide several such results and proofs. We prove completeness for epistemic coalition logic with common knowledge, with distributed knowledge, and with both common and distributed knowledge, respectively. Furthermore, we completely characterise the complexity of the satisfiability problem for each of the three logics. We also study logics with interaction axioms connecting coalitional ability and knowledge.
| Original language | English |
|---|---|
| Pages (from-to) | 1041-1069 |
| Number of pages | 29 |
| Journal | Journal of Logic and Computation |
| Volume | 29 |
| Issue number | 7 |
| DOIs | |
| Publication status | Published - 2019 |
| Externally published | Yes |