From Knowledge to Action: Logics of Permitted and Obligatory Announcements

We formalize the notions of “permitted and obligatory announcements” in the context of information security, such as privacy policy compliance. In a sender-receiver setting, we define the sender’s permitted and obligatory announcements in terms of the receiver’s ideal epistemic states (i.e., the epistemic states that comply with the given security policies). We propose two logics, LPOA and DLPOA, to reason about permitted and obligatory announcements in static and dynamic contexts, respectively. These two logics are completely axiomatized, and we also study generalizations in which the receiver’s knowledge is characterized by non-S5 logics. Our paper makes two main contributions to the formalization of permitted and obligatory announcements: First, we clarify the interplay between the sender’s permitted and obligatory announcements and the receiver’s knowledge. Second, we distinguish between weakly and strongly permitted announcements.

Authors

Institutions

Publication Details

Journal
Journal of Artificial Intelligence Research
Published
2025-03-22
DOI
https://doi.org/10.1613/jair.1.17180
Primary Topic
Classical Philosophy and Thought
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

From Knowledge to Action: Logics of Permitted and Obligatory Announcements

Guillaume Aucher, Li Xu, Réka Markovich, Dov M. Gabbay
Journal of Artificial Intelligence Research
Classical Philosophy and Thought
article

From Knowledge to Action: Logics of Permitted and Obligatory Announcements

Guillaume Aucher, Li Xu, Réka Markovich, Dov M. Gabbay
article en

Abstract

We formalize the notions of “permitted and obligatory announcements” in the context of information security, such as privacy policy compliance. In a sender-receiver setting, we define the sender’s permitted and obligatory announcements in terms of the receiver’s ideal epistemic states (i.e., the epistemic states that comply with the given security policies). We propose two logics, LPOA and DLPOA, to reason about permitted and obligatory announcements in static and dynamic contexts, respectively. These two logics are completely axiomatized, and we also study generalizations in which the receiver’s knowledge is characterized by non-S5 logics. Our paper makes two main contributions to the formalization of permitted and obligatory announcements: First, we clarify the interplay between the sender’s permitted and obligatory announcements and the receiver’s knowledge. Second, we distinguish between weakly and strongly permitted announcements.

Journal of Artificial Intelligence ResearchVol. 82
University of Luxembourg (LU)
Openalex Percentile: Top 94%
Classical Philosophy and Thought
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

From Knowledge to Action: Logics of Permitted and Obligatory Announcements — Guillaume Aucher, Li Xu, et al. · Journal of Artificial Intelligence Research (2025) | TGRS Research Map | TGRS