Dynamic Logic of Parallel Propositional Assignments and Its Applications to Planning

Abstract

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.

Cite

Text

Herzig et al. "Dynamic Logic of Parallel Propositional Assignments and Its Applications to Planning." International Joint Conference on Artificial Intelligence, 2019. doi:10.24963/IJCAI.2019/774

Markdown

[Herzig et al. "Dynamic Logic of Parallel Propositional Assignments and Its Applications to Planning." International Joint Conference on Artificial Intelligence, 2019.](https://mlanthology.org/ijcai/2019/herzig2019ijcai-dynamic/) doi:10.24963/IJCAI.2019/774

BibTeX

@inproceedings{herzig2019ijcai-dynamic,
  title     = {{Dynamic Logic of Parallel Propositional Assignments and Its Applications to Planning}},
  author    = {Herzig, Andreas and Maris, Frédéric and Vianey, Julien},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {2019},
  pages     = {5576-5582},
  doi       = {10.24963/IJCAI.2019/774},
  url       = {https://mlanthology.org/ijcai/2019/herzig2019ijcai-dynamic/}
}