• A Closeness- and Priority-Based Logical Study of Social Network Creation 

      Smets, Sonja; Velázquez-Quesada, Fernando R. (Journal article; Peer reviewed, 2020)
      This paper is part of an on-going programme on the study of the logical aspects of social network formation. It recalls the so-called social network model, discussing the properties of a notion of closeness between agents ...
    • 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 ...
    • 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 ...
    • A Modal Logic for Supervised Learning 

      Baltag, Alexandru; Li, Dazhu; Pedersen, Mina Young (Journal article; Peer reviewed, 2022)
      Formal learning theory formalizes the process of inferring a general result from examples, as in the case of inferring grammars from sentences when learning a language. In this work, we develop a general framework—the ...
    • 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 ...