Dynamic Logic of Propositional Assignments: A Well-Behaved Variant of PDL

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2013 28th Annual ACM/IEEE Symposium on Logic in Computer Science s. 143 - 152
Hlavní autoři: Balbiani, Philippe, Herzig, Andreas, Troquard, Nicolas
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.06.2013
Témata:
Abstracts
Complexity theory
Computational modeling
Cost accounting
Handheld computers
Model checking
Radiation detectors
ISBN:1479904139, 9781479904136
ISSN:1043-6871
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISBN:1479904139
9781479904136
ISSN:1043-6871
DOI:10.1109/LICS.2013.20