Verification and Strategy Synthesis for Coalition Announcement Logic

Alechina, Natasha; Ditmarsch, Hans van; Galimullin, Rustam; Wang, Tuo

doi:10.1007/s10849-021-09339-6

Cited by 3 publications

(4 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The complexity of the model checking problem for L * S: ! is PSPACEcomplete: this is in line with the complexity of other logics of quantified information change as, e.g., arbitrary public announcements [6], group announcement logic [2], coalition announcement logic [4] and arbitrary arrow update logic [37]. However, this case has an interesting twist.…”

Section: Model Checkingsupporting

confidence: 57%

“…We have also proved that the model checking problem for the new language L * S: ! is PSPACEcomplete, similar to DELs with action models [5,13] and logics with quantification over information change [2,4,6,37]. Finally, we showed that L * S: !…”

Section: Summary and Further Workmentioning

confidence: 56%

“…For a fair comparison with partial communication, here is an alternative public announcement definition that rather removes all edges between worlds disagreeing on 's truth-value [31]. 4 Definition 3.1 (Public announcement). Let = , , be a model; take a formula .…”

Section: Partial Communication Vs Public Announcementsmentioning

confidence: 99%

“…An axiom system can be obtained by using the reduction axioms technique, with the crucial axiom being [40]. As before, the 4 Cf. [16], which removes only edges pointing to ¬ -worlds.…”

Section: Definition 32 (Modality [ !]mentioning

confidence: 99%

See 3 more Smart Citations

(Arbitrary) Partial Communication

Galimullin¹,

Velázquez–Quesada²

2023

Preprint

View full text Add to dashboard Cite

Communication within groups of agents has been lately the focus of research in dynamic epistemic logic (DEL). This paper studies a recently introduced form of partial (more precisely, topic-based) communication. This type of communication allows for modelling scenarios of multi-agent collaboration and negotiation, and it is particularly well-suited for situations in which sharing all information is not feasible/advisable. After presenting results on invariance and complexity of model checking, the paper compares partial communication to public announcements, probably the most well-known type of communication in DEL. It is shown that the settings are, update-wise, incomparable: there are scenarios in which the effect of a public announcement cannot be replicated by partial communication, and vice versa. Then, the paper shifts its attention to strategic topic-based communication. It does so by extending the language with a modality that quantifies over the topics the agents can 'talk about'. For this new framework, it provides a complete axiomatisation, showing also that the new language's model checking problem is PSPACE-complete. The paper closes showing that, in terms of expressivity, this new language of arbitrary partial communication is incomparable to that of arbitrary public announcements. CCS CONCEPTS• Theory of computation → Modal and temporal logics.

show abstract

Section: Model Checkingsupporting

confidence: 57%

Section: Summary and Further Workmentioning

confidence: 56%

Section: Partial Communication Vs Public Announcementsmentioning

confidence: 99%

“…An axiom system can be obtained by using the reduction axioms technique, with the crucial axiom being [40]. As before, the 4 Cf. [16], which removes only edges pointing to ¬ -worlds.…”

Section: Definition 32 (Modality [ !]mentioning

confidence: 99%

See 2 more Smart Citations

(Arbitrary) Partial Communication

Galimullin¹,

Velázquez–Quesada²

2023

Preprint

View full text Add to dashboard Cite

show abstract

Quantifying over information change with common knowledge

Ågotnes

Galimullin

2023

Auton Agent Multi-Agent Syst

View full text Add to dashboard Cite

Public announcement logic (PAL) extends multi-agent epistemic logic with dynamic operators modelling the effects of public communication. Allowing quantification over public announcements lets us reason about the existence of an announcement that reaches a certain epistemic goal. Two notable examples of logics of quantified announcements are arbitrary public announcement logic (APAL) and group announcement logic (GAL). While the notion of common knowledge plays an important role in PAL, and in particular in characterisations of epistemic states that an agent or a group of agents might make come about by performing public announcements, extensions of APAL and GAL with common knowledge still haven’t been studied in detail. That is what we do in this paper. In particular, we consider both conservative extensions, where the semantics of the quantifiers is not changed, as well as extensions where the scope of quantification also includes common knowledge formulas. We compare the expressivity of these extensions relative to each other and other connected logics, and provide sound and complete axiomatisations. Finally, we show how the completeness results can be used for other logics with quantification over information change.

show abstract

Logics with Group Announcements and Distributed Knowledge: Completeness and Expressive Power

Ågotnes

Alechina

Galimullin

2022

J of Log Lang and Inf

Self Cite

View full text Add to dashboard Cite

Public announcement logic (PAL) is an extension of epistemic logic with dynamic operators that model the effects of all agents simultaneously and publicly acquiring the same piece of information. One of the extensions of PAL, group announcement logic (GAL), allows quantification over (possibly joint) announcements made by agents. In GAL, it is possible to reason about what groups can achieve by making such announcements. It seems intuitive that this notion of coalitional ability should be closely related to the notion of distributed knowledge, the implicit knowledge of a group. Thus, we study the extension of GAL with distributed knowledge, and in particular possible interaction properties between GAL operators and distributed knowledge. The perhaps surprising result is that, in fact, there are no interaction properties, contrary to intuition. We make this claim precise by providing a sound and complete axiomatisation of GAL with distributed knowledge. We also consider several natural variants of GAL with distributed knowledge, as well as some other related logic, and compare their expressive power.

show abstract

Verification and Strategy Synthesis for Coalition Announcement Logic

Cited by 3 publications

References 20 publications

(Arbitrary) Partial Communication

(Arbitrary) Partial Communication

Quantifying over information change with common knowledge

Logics with Group Announcements and Distributed Knowledge: Completeness and Expressive Power

Contact Info

Product

Resources

About