mlsanityData to 14 Oct 2026

Asynchronous Announcements

arXiv 1705.03392 ↗First posted 8 May 2017cs.AI cs.DC cs.LOcited by 2

Not on the map. Why?

Abstract (arXiv)

We propose a multi-agent epistemic logic of asynchronous announcements, where truthful announcements are publicly sent but individually received by agents, and in the order in which they were sent. Additional to epistemic modalities the logic contains dynamic modalities for making announcements and for receiving them. What an agent believes is a function of her initial uncertainty and of the announcements she has received. Beliefs need not be truthful, because announcements already made may not yet have been received. As announcements are true when sent, certain message sequences can be ruled out, just like inconsistent cuts in distributed computing. We provide a complete axiomatization for this asynchronous announcement logic (AA). It is a reduction system that also demonstrates that any formula in AA is equivalent to one without dynamic modalities, just as for public announcement logic. A detailed example modelling message exchanging processes in distributed computing in AA closes our investigation.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 8 May 2017.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2022: 1; 2023: 0; 2024: 0; 2025: 0; 2026: 1.

2 papers.