Group announcement logic

DOI10.1016/j.jal.2008.12.002zbMath1200.03015OpenAlexW2155318727MaRDI QIDQ975877

Philippe Balbiani, Pablo Seban, Thomas Ågotnes, Hans P. van Ditmarsch

Publication date: 11 June 2010

Published in: Journal of Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jal.2008.12.002

zbMATH Keywords

coalitionsdynamic epistemic logicinformation-based protocolslogics for multi-agent systems

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logics of knowledge and belief (including belief change) (03B42) Agent technology and artificial intelligence (68T42)

Related Items (30)

The undecidability of quantified announcements ⋮ Logics with group announcements and distributed knowledge: completeness and expressive power ⋮ Arbitrary arrow update logic ⋮ The undecidability of arbitrary arrow update logic ⋮ Resolving distributed knowledge ⋮ Putting right the wording and the proof of the Truth Lemma forAPAL ⋮ Propositional quantification in logics of contingency ⋮ To be announced ⋮ Communication pattern logic: epistemic and topological views ⋮ Arbitrary public announcement logic with memory ⋮ Satisfiability of Arbitrary Public Announcement Logic with Common Knowledge is Σ^1_1-hard ⋮ Unnamed Item ⋮ Together we know how to achieve: an epistemic logic of know-how ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Simulative belief logic ⋮ Reasoning about permitted announcements ⋮ Exploring the tractability border in epistemic tasks ⋮ Coalition and relativised group announcement logic ⋮ Intelligence in Strategic Games ⋮ The dynamics of epistemic attitudes in resource-bounded agents ⋮ What will they say? -- Public announcement games ⋮ Knowing-how under uncertainty ⋮ On composition of bounded-recall plans ⋮ Positive announcements ⋮ Alternating-Time Temporal Announcement Logic ⋮ Mathematics of Public Announcements ⋮ Verification and strategy synthesis for coalition announcement logic ⋮ Knowing the price of success

Cites Work

• Unnamed Item
• Unnamed Item
• Axiomatising the logic of computer programming
• The Russian cards problem
• On logics with two variables
• Alternating-time temporal logic
• ‘KNOWABLE’ AS ‘KNOWN AFTER AN ANNOUNCEMENT’
• A Complete STIT Logic for Knowledge and Action, and Some of Its Applications
• Dynamic Epistemic Logic and Knowledge Puzzles
• Constructive knowledge: what agents can achieve under imperfect information
• Alternation
• A Modal Logic for Coalitional Power in Games
• What one may come to know

This page was built for publication: Group announcement logic