Dynamic logic of propositional assignments : a well-behaved variant of PDL - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

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.
Fichier principal
Vignette du fichier
balbiani_12432.pdf (312.76 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01240721 , version 1 (09-12-2015)

Identifiers

Cite

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, ⟨10.1109/LICS.2013.20⟩. ⟨hal-01240721⟩
122 View
494 Download

Altmetric

Share

Gmail Facebook X LinkedIn More