Coalition logic with individual, distributed and common knowledge

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 se...

Full description

Bibliographic Details
Main Authors: Ågotnes, Thomas, Alechina, Natasha
Format: Article
Published: Oxford University Press 2016
Subjects:
Online Access:https://eprints.nottingham.ac.uk/35768/
_version_ 1848795157498953728
author Ågotnes, Thomas
Alechina, Natasha
author_facet Ågotnes, Thomas
Alechina, Natasha
author_sort Ågotnes, Thomas
building Nottingham Research Data Repository
collection Online Access
description 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.
first_indexed 2025-11-14T19:27:37Z
format Article
id nottingham-35768
institution University of Nottingham Malaysia Campus
institution_category Local University
last_indexed 2025-11-14T19:27:37Z
publishDate 2016
publisher Oxford University Press
recordtype eprints
repository_type Digital Repository
spelling nottingham-357682020-05-04T17:32:52Z https://eprints.nottingham.ac.uk/35768/ Coalition logic with individual, distributed and common knowledge Ågotnes, Thomas Alechina, Natasha 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. Oxford University Press 2016-01-09 Article PeerReviewed Ågotnes, Thomas and Alechina, Natasha (2016) Coalition logic with individual, distributed and common knowledge. Journal of Logic and Computation . exv085. ISSN 0955-792X Coalition logic epistemic logic distributed knowledge common knowledge completeness computational complexity http://logcom.oxfordjournals.org/content/early/2016/01/08/logcom.exv085 doi:10.1093/logcom/exv085 doi:10.1093/logcom/exv085
spellingShingle Coalition logic
epistemic logic
distributed knowledge
common knowledge
completeness
computational complexity
Ågotnes, Thomas
Alechina, Natasha
Coalition logic with individual, distributed and common knowledge
title Coalition logic with individual, distributed and common knowledge
title_full Coalition logic with individual, distributed and common knowledge
title_fullStr Coalition logic with individual, distributed and common knowledge
title_full_unstemmed Coalition logic with individual, distributed and common knowledge
title_short Coalition logic with individual, distributed and common knowledge
title_sort coalition logic with individual, distributed and common knowledge
topic Coalition logic
epistemic logic
distributed knowledge
common knowledge
completeness
computational complexity
url https://eprints.nottingham.ac.uk/35768/
https://eprints.nottingham.ac.uk/35768/
https://eprints.nottingham.ac.uk/35768/