Skip to Main content Skip to Navigation
Conference papers

Dynamic logic of propositional assignments : a well-behaved variant of PDL

Abstract : We study a version of Propositional Dynamic Logic (PDL) that we call Dynamic Logic of Propositional Assignments (DL-PA). The atomic programs of DL-PA are assignments of propositional variables to true or to false. We show that DL-PA behaves better than PDL, having e.g. compactness and eliminability of the Kleene star. We establish tight complexity results: both satisfiability and model checking are EXPTIME-complete.
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Open Archive Toulouse Archive Ouverte (OATAO) Connect in order to contact the contributor
Submitted on : Wednesday, December 9, 2015 - 2:33:03 PM
Last modification on : Wednesday, June 1, 2022 - 4:03:12 AM
Long-term archiving on: : Thursday, March 10, 2016 - 2:18:34 PM


Files produced by the author(s)


  • HAL Id : hal-01240721, version 1
  • OATAO : 12432


Philippe Balbiani, Andreas Herzig, Nicolas Troquard. Dynamic logic of propositional assignments : a well-behaved variant of PDL. 28th Annual IEEE/ACM Symposium on Logic in Computer Science (LICS 2013), Jun 2013, New Orleans, LA, United States. pp.143-152. ⟨hal-01240721⟩



Record views


Files downloads