Public announcements, public assignments and the complexity of their logic

We study the extension of public announcement logic PAL by public assignments, which we call PALA. Just as in the case of PAL, the standard procedure for deciding PALA validity, i.e. the use of so-called reduction axioms to translate PALA formulae into formulae in epistemic logic EL, may lead to exponential growth. In this paper, we show that such a price is not mandatory, for we provide a polynomial translation of PALA into EL. This is based on abbreviations of subformulae by new propositional letters. Such optimal translation also enables us to show the computational complexity of the problem of deciding PALA validity, which turns out to be coNP-complete in the single-agent case and PSPACE-complete in the multiagent case.

[1]  Lawrence S. Moss,et al.  The Logic of Public Announcements and Common Knowledge and Private Suspicions , 1998, TARK.

[2]  Raymond Reiter,et al.  The Frame Problem in the Situation Calculus: A Simple Solution (Sometimes) and a Completeness Result for Goal Regression , 1991, Artificial and Mathematical Theory of Computation.

[3]  Wiebe van der Hoek,et al.  Succinctness of Epistemic Languages , 2011, IJCAI.

[4]  Hector J. Levesque,et al.  The Frame Problem and Knowledge-Producing Actions , 1993, AAAI.

[5]  Hector J. Levesque,et al.  Knowledge, action, and the frame problem , 2003, Artif. Intell..

[6]  Andreas Herzig,et al.  Optimal Regression for Reasoning about Knowledge and Actions , 2007, AAAI.

[7]  Carsten Lutz,et al.  Complexity and succinctness of public announcement logic , 2006, AAMAS '06.

[8]  Christoph Weidenbach,et al.  Computing Small Clause Normal Forms , 2001, Handbook of Automated Reasoning.

[9]  Jan van Eijck,et al.  Logics of communication and change , 2006, Inf. Comput..

[10]  Wiebe van der Hoek,et al.  Dynamic epistemic logic with assignment , 2005, AAMAS '05.

[11]  Alex M. Andrew,et al.  Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems , 2002 .

[12]  Barteld P. Kooi,et al.  Expressivity and completeness for public update logics via reduction axioms , 2007, J. Appl. Non Class. Logics.

[13]  Jan A. Plaza,et al.  Logics of public communications , 2007, Synthese.

[14]  Hector J. Levesque,et al.  Reasoning about Noisy Sensors and Effectors in the Situation Calculus , 1995, Artif. Intell..

[15]  Raymond Reiter,et al.  Knowledge in Action: Logical Foundations for Specifying and Implementing Dynamical Systems , 2001 .

[16]  Andreas Herzig,et al.  From Situation Calculus to Dynamic Epistemic Logic , 2011, J. Log. Comput..

[17]  Dominique Longin,et al.  A Logic for Planning under Partial Observability , 2000, AAAI/IAAI.

[18]  Jelle Gerbrandy,et al.  Dynamic epistemic logic , 1998 .