Coalition logic with individual, distributed and common knowledge1
| Autor: | Natasha Alechina, Thomas Ågotnes |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Discrete mathematics
Theoretical computer science Logic 0102 computer and information sciences ComputingMethodologies_ARTIFICIALINTELLIGENCE 01 natural sciences Theoretical Computer Science TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGES Distributed knowledge Arts and Humanities (miscellaneous) Epistemic modal logic 010201 computation theory & mathematics Hardware and Architecture Completeness (order theory) Common knowledge T-norm fuzzy logics Boolean satisfiability problem Software Axiom Mathematics |
| Zdroj: | Journal of Logic and Computation. 29:1041-1069 |
| ISSN: | 1465-363X 0955-792X |
| DOI: | 10.1093/logcom/exv085 |
| Popis: | 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. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|