R. Galimullin

activity

20172026

most citedCoalition and Group Announcement Logic

10 citations · 18 across the 14 of their papers we have counts for

collaborators

Showing 2023Show all

2 papers · 1 filter

cs.LO2023★ 2 cited

Satisfiability of Arbitrary Public Announcement Logic with Common Knowledge is $Σ_{1}^{1}$ -hard

Rustam Galimullin, Louwe B. Kuijer

Arbitrary Public Announcement Logic with Common Knowledge (APALC) is an extension of Public Announcement Logic with common knowledge modality and quantifiers over announcements. We…

cs.LO2023

(Arbitrary) Partial Communication

Rustam Galimullin, Fernando R. Velázquez-Quesada

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 precise…

Satisfiability of Arbitrary Public Announcement Logic with Common Knowledge is Σ11​-hard

(Arbitrary) Partial Communication

Satisfiability of Arbitrary Public Announcement Logic with Common Knowledge is $Σ_{1}^{1}$ -hard