Second-order Propositional Announcement Logic

Belardinelli, Francesco, van Ditmarsch, Hans and van der Hoek, Wiebe ORCID: 0000-0003-0721-0310 (2016) Second-order Propositional Announcement Logic In: Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 1, 2016-5-9 - 2016-5-13, Singapore.

Text aamas2016_final.pdf - Unspecified Download (471kB)

Abstract

In this paper we introduce Second-order Propositional Announcement Logic (SOPAL): a language to express arbitrary announcements in Public Announcement Logic, by means of propositional quantification. We present SOPAL within a multi-agent context, and show that it is rich enough to express complex notions such as preservation under arbitrary announcements, knowability, and successfulness. We analyse the model theory of SOPAL and prove that it is strictly more expressive than Arbitrary PAL [2], and as expressive as Second-order Propositional Epistemic Logic [4], even though exponentially more succinct than the latter. These results points to a rich logic, with nice computational properties nonetheless, such as a decidable model checking problem and a complete axiomatisation.

Item Type:	Conference Item (Unspecified)
Uncontrolled Keywords:	46 Information and Computing Sciences, 4904 Pure Mathematics, 49 Mathematical Sciences, 4602 Artificial Intelligence, 50 Philosophy and Religious Studies, 5003 Philosophy
Depositing User:	Symplectic Admin
Date Deposited:	05 May 2016 15:25
Last Modified:	22 May 2026 23:47
DOI:	10.65109/tcof2574
Related Websites:	Author Publisher
URI:	https://livrepository.liverpool.ac.uk/id/eprint/3000490
Disclaimer:	The University of Liverpool is not responsible for content contained on other websites from links within repository metadata. Please contact us if you notice anything that appears incorrect or inappropriate.