A guide to completeness and complexity for modal logics of knowledge and belief
Artificial Intelligence
Reasoning about knowledge
Epistemic Logic for AI and Computer Science
Epistemic Logic for AI and Computer Science
Dynamic Logic
Alternating-time temporal logic
Journal of the ACM (JACM)
Complete axiomatization and decidability of alternating-time temporal logic
Theoretical Computer Science
Knowing how to play: uniform choices in logics of agency
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
A normal simulation of coalition logic and an epistemic extension
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
A Complete STIT Logic for Knowledge and Action, and Some of Its Applications
Declarative Agent Languages and Technologies VI
Dynamic Epistemic Logic
Strategic games and truly playable effectivity functions
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Public announcement logic with distributed knowledge
LORI'11 Proceedings of the Third international conference on Logic, rationality, and interaction
| Hi-index | 0.00 |
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.