The undecidability of quantified announcements
This paper demonstrates the undecidability of a number of logics with quantification over
public announcements: arbitrary public announcement logic (APAL), group announcement …
public announcements: arbitrary public announcement logic (APAL), group announcement …
Arbitrary action model logic and action model synthesis
J Hales - 2013 28th Annual ACM/IEEE Symposium on Logic in …, 2013 - ieeexplore.ieee.org
We present a method for synthesising action models that result in a given post-condition
when executed on any Kripke model. Action models represent social actions that affect the …
when executed on any Kripke model. Action models represent social actions that affect the …
Coalition and relativised group announcement logic
R Galimullin - Journal of Logic, Language and Information, 2021 - Springer
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 …
reflected in arbitrary, group, and coalition announcement logics (APAL, GAL, and CAL …
[HTML][HTML] Arbitrary arrow update logic
In this paper we introduce arbitrary arrow update logic (AAUL). The logic AAUL takes arrow
update logic, a dynamic epistemic logic where the accessibility relations of agents are …
update logic, a dynamic epistemic logic where the accessibility relations of agents are …
Quantifying over information change with common knowledge
Public announcement logic (PAL) extends multi-agent epistemic logic with dynamic
operators modelling the effects of public communication. Allowing quantification over public …
operators modelling the effects of public communication. Allowing quantification over public …
[HTML][HTML] The complexity of one-agent refinement modal logic
We investigate the complexity of satisfiability for one-agent refinement modal logic (RML), a
known extension of basic modal logic (ML) obtained by adding refinement quantifiers on …
known extension of basic modal logic (ML) obtained by adding refinement quantifiers on …
[PDF][PDF] Quantifying over boolean announcements
Various extensions of public announcement logic have been proposed with quantification
over announcements. The best-known extension is called arbitrary public announcement …
over announcements. The best-known extension is called arbitrary public announcement …
Positive announcements
Arbitrary public announcement logic (APAL APAL) reasons about how the knowledge of a
set of agents changes after true public announcements and after arbitrary announcements of …
set of agents changes after true public announcements and after arbitrary announcements of …
Logics with group announcements and distributed knowledge: Completeness and expressive power
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 …
that model the effects of all agents simultaneously and publicly acquiring the same piece of …
Before announcement
Before announcement Page 1 HAL Id: hal-01650180 https://hal.science/hal-01650180
Submitted on 28 Nov 2017 HAL is a multi-disciplinary open access archive for the deposit and …
Submitted on 28 Nov 2017 HAL is a multi-disciplinary open access archive for the deposit and …