A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is
We study the extension of public announcement logic PAL by public assignments, that 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 price is not mandatory, for we provide a polynomial translation of PALA into EL. This is based on abbreviations of subformulae by new propositionaldoi:10.1080/11663081.2012.705964 fatcat:56r5waj2r5dobblkcuxnii7yga