论文信息 - DL-PA and DCL-PC: model checking and satisfiability problem are indeed in PSPACE

DL-PA and DCL-PC: model checking and satisfiability problem are indeed in PSPACE

We prove that the model checking and the satisfiability problem of both Dynamic Logic of Propositional Assignments DL-PA and Coalition Logic of Propositional Control and Delegation DCL-PC are in PSPACE. We explain why the proof of EXPTIME-hardness of the model checking problem of DL-PA presented in (Balbiani, Herzig, Troquard, 2013) is false. We also explain why the proof of membership in PSPACE of the model checking problem of DCL-PC given in (van der Hoek, Walther, Wooldridge, 2010) is wrong.

[1] Walter J. Savitch,et al. Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[2] Michael Wooldridge,et al. Reasoning About the Transfer of Control , 2014, J. Artif. Intell. Res..

[3] Michael Sipser,et al. Introduction to the Theory of Computation , 1996, SIGA.

[4] Larry J. Stockmeyer,et al. Provably Difficult Combinatorial Games , 1979, SIAM J. Comput..

[5] Andreas Herzig,et al. Dynamic Logic of Propositional Assignments: A Well-Behaved Variant of PDL , 2013, 2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science.

[6] Johann A. Makowsky,et al. Propositional Dynamic Logic with Local Assignments , 1985, Theor. Comput. Sci..

[7] Emiliano Lorini,et al. A Dynamic Logic of Normative Systems , 2011, IJCAI.

[8] Valentin Goranko,et al. Big brother logic: logical modeling and reasoning about agents equipped with surveillance cameras in the plane , 2014, AAMAS.