Coalition logic with individual, distributed and common knowledge1

• DOI: 10.1093/logcom/exv085
• Publication Date: 2016-01-10T01:48:39Z
• Authors: Thomas Ågotnes; Natasha Alechina
• Keywords: Completeness (order theory); Satisfiability; T-norm fuzzy logics

Abstract Coalition logic is currently one of the most popular logics for multi-agent systems. While combining coalitional and epistemic operators have received considerable attention, completeness results extensions coalition so far been missing. In this paper we provide several such proofs. We prove with common knowledge, distributed both respectively. Furthermore, completely characterise complexity satisfiability problem each three logics. also study interaction axioms connecting ability knowledge.