2025 Jun 12 16:00-17:30 Carlo Cordasco (University of Manchester) The Accuracy-Explainability trade-off and its implication

Vredenburgh (2021) argues for a collective interest in “explainability” of machine‐learning outputs on the grounds that, without genuine causal explanations, agents lack the means to revise their strategies. This paper begins by examining the implicit theory of explanation at stake…More>>

2025 Jun 12 14:00-15:30 Rui Zhu (祝瑞, University of Auckland) How to Handle Arbitrary Announcement Operators: Completeness and Model Transformation in Social Announcement Logic

Arbitrary announcement operators are dynamic modalities that quantify over all possible messages that can be announced. They enable the expression of whether a given formula remains valid under any such announcement, thereby significantly enhancing the expressive power of Social Announcement Logic (SAL)…More>>