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.
| Original language | English |
|---|---|
| Pages | 872-879 |
| Number of pages | 8 |
| Publication status | Published - 2012 |
| Externally published | Yes |
| Event | 11th International Conference on Autonomous Agents and Multiagent Systems 2012: Innovative Applications Track, AAMAS 2012 - Valencia, Spain Duration: 4 Jun 2012 → 8 Jun 2012 |
Conference
| Conference | 11th International Conference on Autonomous Agents and Multiagent Systems 2012: Innovative Applications Track, AAMAS 2012 |
|---|---|
| Abbreviated title | AAMAS 2012 |
| Country/Territory | Spain |
| City | Valencia |
| Period | 4/06/12 → 8/06/12 |
Keywords
- Coalition logic
- Completeness
- Computational complexity
- Epistemic logic