Axiomatising the Logic of Computer Programming
Axiomatising the Logic of Computer Programming
Alternating-time temporal logic
Journal of the ACM (JACM)
Fundamenta Informaticae - Multiagent Systems (FAMAS'03)
What can we achieve by arbitrary announcements?: A dynamic take on Fitch's knowability
TARK '07 Proceedings of the 11th conference on Theoretical aspects of rationality and knowledge
Dynamic Epistemic Logic
Group announcements: logic and games
CLIMA'10 Proceedings of the 11th international conference on Computational logic in multi-agent systems
A logic for reasoning about counterfactual emotions
Artificial Intelligence
Tractable model checking for fragments of higher-order coalition logic
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Alternating-time temporal announcement logic
CLIMA'11 Proceedings of the 12th international conference on Computational logic in multi-agent systems
| Hi-index | 0.00 |
Two currently active strands of research on logics for multi-agent systems are dynamic epistemic logic, focusing on the epistemic consequences of actions, and logics of coalitional ability, focusing on what coalitions of agents can achieve by cooperating strategically. In this paper we make a first attempt to bridge these topics by considering the question: "what can a coalition achieve by public announcements?". We propose, first, an extension of public announcement logic with constructs of the form φ, where G is a set of agents, with the intuitive meaning that G can jointly make an announcement such that φ will be true afterwards. Second, we consider a setting where all agents can make (truthful) announcements at the same time, and propose a logic with a construct φ, meaning that G can jointly make an announcement such that no matter what the other agents announce, φ will be true. The latter logic is closely related to Marc Pauly's Coalition Logic.