Coalition and Relativised Group Announcement Logic

Galimullin, Rustam

doi:10.1007/s10849-020-09327-2

Cited by 9 publications

(3 citation statements)

References 28 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Finally, the result trivially extends to the logics that are extensions of any of QPAL's (e.g. [13]). Interestingly, restricting the quantification in APAL to just announcements of Boolean formulas still results in a logic with no FMP.…”

Section: Conclusion and Further Researchmentioning

confidence: 77%

No Finite Model Property for Logics of Quantified Announcements

Ditmarsch¹,

French²,

Galimullin³

2021

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

Quantification over public announcements shifts the perspective from reasoning strictly about the results of a particular announcement to reasoning about the existence of an announcement that achieves some certain epistemic goal. Depending on the type of the quantification, we get different formalisms, the most known of which are arbitrary public announcement logic (APAL), group announcement logic (GAL), and coalition announcement logic (CAL). It has been an open question whether the logics have the finite model property, and in the paper we answer the question negatively. We also discuss how this result is connected to other open questions in the field.

show abstract

Section: Conclusion and Further Researchmentioning

confidence: 77%

No Finite Model Property for Logics of Quantified Announcements

Ditmarsch¹,

French²,

Galimullin³

2021

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Apart from that, we also plan to extend our framework and allow quantification over queries in the spirit of logics of quantified announcements, e.g. APAL [15], GAL [3], CAL [5,37], and their versions with group knowledge [2,4]. Another important direction for future work is to consider more complicated communicative actions (e.g.…”

Section: Discussion and Future Workmentioning

confidence: 99%

“…An earlier version of our logic restricted to individual agents was proposed in [27]. The idea of group updates in dynamic epistemic logic was proposed and studied in, for example, [3,5,37,38].…”

Section: Introductionmentioning

confidence: 99%

Dynamic Epistemic Logic for Budget-Constrained Agents

Dolgorukov

Gladyshev²

2023

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Logics for resource-bounded agents have been getting more and more attention in recent years since they provide us with more realistic tools for modelling and reasoning about multi-agent systems. While many existing approaches are based on the idea of agents as imperfect reasoners, who must spend their resources to perform logical inference, this is not the only way to introduce resource constraints into logical settings. In this paper we study agents as perfect reasoners, who may purchase a new piece of information from a trustworthy source. For this purpose we propose dynamic epistemic logic for semi-public queries for resource-bounded agents. In this logic (groups of) agents can perform a query (ask a question) about whether some formula is true and receive a correct answer. These queries are called semi-public, because the very fact of the query is public, while the answer is private. We also assume that every query has a cost and every agent has a budget constraint. Finally, our framework allows us to reason about group queries, in which agents may share resources to obtain a new piece of information together. We demonstrate that our logic is complete, decidable and has an efficient model checking procedure.

show abstract

Dynamic Coalition Logic: Granting and Revoking Dictatorial Powers

Galimullin

Ågotnes

2021

Logic, Rationality, and Interaction

View full text Add to dashboard Cite

Coalition and Relativised Group Announcement Logic

Cited by 9 publications

References 28 publications

No Finite Model Property for Logics of Quantified Announcements

No Finite Model Property for Logics of Quantified Announcements

Dynamic Epistemic Logic for Budget-Constrained Agents

Dynamic Coalition Logic: Granting and Revoking Dictatorial Powers

Contact Info

Product

Resources

About