Skip to main content

Research Repository

Advanced Search

Coalition logic with individual, distributed and common knowledge

�gotnes, Thomas; Alechina, Natasha

Coalition logic with individual, distributed and common knowledge Thumbnail


Authors

Thomas �gotnes

Natasha Alechina



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.

Citation

Ågotnes, T., & Alechina, N. (in press). Coalition logic with individual, distributed and common knowledge. Journal of Logic and Computation, Article exv085. https://doi.org/10.1093/logcom/exv085

Journal Article Type Article
Acceptance Date Dec 1, 2015
Online Publication Date Jan 9, 2016
Deposit Date Aug 8, 2016
Publicly Available Date Aug 8, 2016
Journal Journal of Logic and Computation
Print ISSN 0955-792X
Electronic ISSN 1465-363X
Publisher Oxford University Press
Peer Reviewed Peer Reviewed
Article Number exv085
DOI https://doi.org/10.1093/logcom/exv085
Keywords Coalition logic, epistemic logic, distributed knowledge, common knowledge, completeness, computational complexity
Public URL https://nottingham-repository.worktribe.com/output/773219
Publisher URL http://logcom.oxfordjournals.org/content/early/2016/01/08/logcom.exv085
Contract Date Aug 8, 2016

Files





Downloadable Citations