Resource Separation in Dynamic Logic of Propositional Assignments
We extend dynamic logic of propositional assignments by adding an operator of parallel composition that is inspired by separation logics. We provide an axiomatisation via reduction axioms, thereby establishing decidability. We also prove that the complexity of both the model checking and the satisfiability problem stay in PSPACE.
KeywordsDynamic logic Separation logic Propositional assignments Parallel composition
The paper benefitted from comments and remarks from the reviewers as well as from the attendees of DaLí 2019, in particular Alexandru Baltag, Raul Fervari, Rainer Hähnle and Dexter Kozen. We did our best take their comments into account.
Andreas Herzig’s work was done in the framework of the ANR project “Cognitive Planning in Persuasive Multimodal Communication” (CoPains).
- [BHST14]Balbiani, P., Herzig, A., Schwarzentruber, F., Troquard, N.: DL-PA and DCL-PC: model checking and satisfiability problem are indeed in PSPACE. CoRR, abs/1411.7825 (2014)Google Scholar
- [BHT13]Balbiani, P., Herzig, A., Troquard, N.: Dynamic logic of propositional assignments: a well-behaved variant of PDL. In: Kupferman, O. (ed.) Logic in Computer Science (LICS). IEEE (2013)Google Scholar
- [BO16]Brookes, S., O’Hearn, P.W.: SIGLOG News. Concurrent separation logic 3(3), 47–65 (2016)Google Scholar
- [CHM+16]Cooper, M.C., Herzig, A., Maffre, F., Maris, F., Régnier, P.: A simple account of multi-agent epistemic planning. In: Kaminka, G.A., et al. (eds.) ECAI 2016–22nd European Conference on Artificial Intelligence, The Hague, The Netherlands, 29 August–2 September 2016, Volume 285 of Frontiers in Artificial Intelligence and Applications, pp. 193–201. IOS Press (2016)Google Scholar
- [CS15]Charrier, T., Schwarzentruber, F.: Arbitrary public announcement logic with mental programs. In: Weiss, G., Yolum, P., Bordini, R.H., Elkind, E. (eds.) Proceedings of the 2015 International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2015, Istanbul, Turkey, 4–8 May 2015, pp. 1471–1479. ACM (2015)Google Scholar
- [CS17]Charrier, T., Schwarzentruber, F.: A succinct language for dynamic epistemic logic. In: Larson, K., Winikoff, M., Das, S., Durfee, E.H. (eds.) Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems, AAMAS 2017, São Paulo, Brazil, 8–12 May 2017, pp. 123–131. ACM (2017)Google Scholar
- [GY04]Gardner, P., Yoshida, N. (eds.): CONCUR 2004 - Concurrency Theory, 15th International Conference, London, UK, August 31 – 3 September 2004, Proceedings, Volume 3170 of Lecture Notes in Computer Science. Springer, Heidelberg (2004)Google Scholar
- [Her14]Herzig, A.: Belief change operations: a short history of nearly everything, told in dynamic logic of propositional assignments. In: Baral, C., De Giacomo, G. (eds.) Proceedings of KR 2014. AAAI Press (2014)Google Scholar
- [HMNDBW14]Herzig, A., Menezes, V., De Barros, L.N., Wassermann, R.: On the revision of planning tasks. In: Schaub, T. (ed.) European Conference on Artificial Intelligence (ECAI), August 2014Google Scholar
- [HMV19]Herzig, A., Maris, F., Vianey, J.: Dynamic logic of parallel propositional assignments and its applications to planning. In: Kraus, S. (ed.) Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI 2019, Macao, China, 10–16 August 2019, pp. 5576–5582. ijcai.org (2019)Google Scholar
- [O’H04]O’Hearn, P.W.: Resources, concurrency and local reasoning. Gardner and Yoshida, pp. 49–67Google Scholar
- [vDvdHK07]van Ditmarsch, H.P., van der Hoek, W., Kooi, B.: Dynamic Epistemic Logic. Kluwer Academic Publishers (2007)Google Scholar