Browsing Bergen Open Research Archive by Author "Galimullin, Rustam"

Now showing items 1-11 of 11

    • Action Models for Coalition Logic 

      Galimullin, Rustam; Ågotnes, Thomas (Chapter, 2023)
      In the paper, we study the dynamics of coalitional ability by proposing an extension of coalition logic (CL). CL allows one to reason about what a coalition of agents is able to achieve through a joint action, no matter ...

    • Coalition and Relativised Group Announcement Logic 

      Galimullin, Rustam (Journal article; Peer reviewed, 2021)
      There are several ways to quantify over public announcements. The most notable are reflected in arbitrary, group, and coalition announcement logics (APAL, GAL, and CAL correspondingly), with the latter being the least ...

    • Coalition Logic for Specification and Verification of Smart Contract Upgrades 

      Galimullin, Rustam; Ågotnes, Thomas (Lecture Notes in Computer Science;13753, Chapter, 2022)
      It has been argued in the literature that logics for reasoning about strategic abilities, and in particular coalition logic (CL), are well-suited for verification of properties of smart contracts on a blockchain. Smart ...

    • Dynamic Epistemic Logic of Resource Bounded Information Mining Agents 

      Dolgorukov, Vitaly; Galimullin, Rustam; Gladyshev, Maksim (Chapter, 2024)
      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 ...

    • The Expressivity of Quantified Group Announcements 

      Alechina, Natasha; van Ditmarsch, Hans; French, Tim; Galimullin, Rustam (Journal article; Peer reviewed, 2023)
      Group announcement logic (GAL) and coalition announcement logic (CAL) allow us to reason about whether it is possible for groups and coalitions of agents to achieve their desired epistemic goals through truthful public ...

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

      Ågotnes, Thomas; Alechina, Natasha; Galimullin, Rustam (Journal article; Peer reviewed, 2022)
      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 ...

    • No Finite Model Property for Logics of Quantified Announcements 

      van Ditmarsch, Hans; French, Tim; Galimullin, Rustam (Chapter, 2021)
      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 ...

    • Quantifying over information change with common knowledge 

      Ågotnes, Thomas; Galimullin, Rustam (Journal article; Peer reviewed, 2023)
      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 ...

    • Satisfiability of Arbitrary Public Announcement Logic with Common Knowledge is Σ^1_1-hard 

      Galimullin, Rustam; Kuijer, Louwe B. (Chapter, 2023)
      Arbitrary Public Announcement Logic with Common Knowledge (APALC) is an extension of Public Announcement Logic with common knowledge modality and quantifiers over announcements. We show that the satisfiability problem of ...

    • Verification and Strategy Synthesis for Coalition Announcement Logic 

      Alechina, Natasha; van Ditmarsch, Hans; Galimullin, Rustam; Wang, Tuo (Journal article; Peer reviewed, 2021)
      Coalition announcement logic (CAL) is one of the family of the logics of quantified announcements. It allows us to reason about what a coalition of agents can achieve by making announcements in the setting where the ...

    • Visibility and exploitation in social networks 

      Galimullin, Rustam; Pedersen, Mina Young (Journal article; Peer reviewed, 2023)
      Social media is not a neutral channel. How visible information posted online is depends on many factors such as the network structure, the emotional volatility of the content, and the design of the social media platform. ...