Dynamic logic of parallel propositional assignments and its applications to planning

We introduce a dynamic logic with parallel composition and two kinds of nondeterministic composition, exclusive and inclusive. We show PSPACE completeness of both the model checking and the satisfiability problem and apply our logic to sequential and parallel classical planning where actions have conditional effects.

[1]  Robert Goldblatt,et al.  Parallel action: Concurrent dynamic logic with independent modalities , 1992, Stud Logica.

[2]  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.

[3]  Bernhard Nebel,et al.  Better Eager Than Lazy? How Agent Types Impact the Successfulness of Implicit Coordination , 2018, KR.

[4]  Joseph Boudou,et al.  Iteration-free PDL with storing, recovering and parallel composition: a complete axiomatization , 2018, J. Log. Comput..

[5]  Dimiter Vakarelov,et al.  PDL with intersection of programs: a complete axiomatization , 2003, J. Appl. Non Class. Logics.

[6]  Tom Bylander,et al.  The Computational Complexity of Propositional STRIPS Planning , 1994, Artif. Intell..

[7]  Mario R. F. Benevides,et al.  PDL for structured data: a graph-calculus approach , 2014, Log. J. IGPL.

[8]  David Peleg,et al.  Concurrent dynamic logic , 1987, JACM.

[9]  Andreas Herzig,et al.  Belief Change Operations: A Short History of Nearly Everything, Told in Dynamic Logic of Propositional Assignments , 2014, KR.

[10]  Yanjing Wang,et al.  More for free: a dynamic epistemic framework for conformant planning over transition systems , 2017, J. Log. Comput..

[11]  Avrim Blum,et al.  Fast Planning Through Planning Graph Analysis , 1995, IJCAI.

[12]  Andreas Herzig,et al.  DL-PA and DCL-PC: model checking and satisfiability problem are indeed in PSPACE , 2014, ArXiv.

[13]  Sophie Pinchinat,et al.  Small Undecidable Problems in Epistemic Planning , 2018, IJCAI.

[14]  Thomas Bolander,et al.  Conditional Epistemic Planning , 2012, JELIA.

[15]  Paolo Traverso,et al.  A dynamic logic for acting, sensing, and planning , 2000, J. Log. Comput..

[16]  Craig A. Knoblock.  Generating Parallel Execution Plans with a Partial-order Planner , 1994, AIPS.

[17]  Martin C. Cooper,et al.  A Simple Account of Multi-Agent Epistemic Planning , 2016, ECAI.

[18]  Bernhard Nebel,et al.  Encoding Planning Problems in Nonmonotonic Logic Programs , 1997, ECP.

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

[20]  Alain J. Mayer,et al.  The Complexity of PDL with Interleaving , 1996, Theor. Comput. Sci..

[21]  Mario R. F. Benevides,et al.  Propositional Dynamic Logic with Storing, Recovering and Parallel Composition , 2011, LSFA.

[22]  Mario R. F. Benevides,et al.  Propositional dynamic logics for communicating concurrent programs with CCS's parallel operator , 2014, J. Log. Comput..