Coalition logic with individual, distributed and common knowledge

Ågotnes, Thomas and Alechina, Natasha (2016) Coalition logic with individual, distributed and common knowledge. Journal of Logic and Computation . exv085. ISSN 0955-792X

[img]
Preview
PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (340kB) | Preview

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.

Item Type: Article
Keywords: Coalition logic, epistemic logic, distributed knowledge, common knowledge, completeness, computational complexity
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Identification Number: https://doi.org/10.1093/logcom/exv085
Depositing User: Eprints, Support
Date Deposited: 08 Aug 2016 15:31
Last Modified: 10 Jan 2017 00:24
URI: http://eprints.nottingham.ac.uk/id/eprint/35768

Actions (Archive Staff Only)

Edit View Edit View