Library

A Fixed-Parameter Study on Propositional Dynamic Logic

Since its establishment, propositional dynamic logic (PDL) has been a subject of intensive academic research and frequent use in the industry. We have studied the complexity of some PDL problems and in this paper, we show results for some special cases of PL and PDL.

Logic, Reasoning, and Knowledge
View graphSource

Paper

Similar papers

Decidability and Complexity of Some Finitely-valued Dynamic LogicsIgor Sedlár2021 In Library
Finitely-valued propositional dynamic logicIgor Sedlár2020 · arXiv (Cornell University) In Library
Propositional Dynamic Logic for PlanningMário Benevides, Anna Moreira De Oliveira2020 In Library
On Explicit Solutions to Fixed-Point Equations in Propositional Dynamic LogicTim S. Lyon2024 · arXiv (Cornell University) In Library
Towards a Proof System for Probabilistic Dynamic LogicEinar Broch Johnsen, Eduard Kamburjan, Raúl Pardo et al.2024 · arXiv (Cornell University) In Library
Simple dynamic logic with parallel composition and applications to planningAndreas Herzig, Frédéric Maris, Elise Perrotin et al.2025 · Journal of Logic and Computation In Library
On A Parameterized Theory of Dynamic Logic for Operationally-based ProgramsYuanrui Zhang2026 · Open MIND In Library
On Propositional Dynamic Logic and ConcurrencyMatteo Acclavio, Fabrizio Montesi, Marco Peressotti2024 · arXiv (Cornell University) In Library
Hennessy-Milner Results for Probabilistic PDLTao Gu, Alexandra Silva, Fabio Zanasi2020 · Electronic Notes in Theoretical Computer Science In Library
Separating the Expressive Power of Propositional Dynamic and Modal Fixpoint LogicsEric Alsmann, Florian Bruse, Martin Lange2021 · Electronic Proceedings in Theoretical Computer Science In Library
© 2026 NYSGPT2525 LLC