Propositional dynamic logic with quantification over regular computation sequences

DOI10.1007/978-3-030-93100-1_19OpenAlexW4200384261MaRDI QIDQ2151417

Igor Sedlár

Publication date: 1 July 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-93100-1_19

zbMATH Keywords

quantificationplanningfinite automatapropositional dynamic logic

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A different approach to deontic logic: Deontic logic viewed as a variant of dynamic logic
• Automata-theoretic techniques for modal logics of programs
• Propositional dynamic logic of regular programs
• Deterministic propositional dynamic logic: finite models, complexity, and completeness
• Concurrent dynamic logic
• Naming and Identity in Epistemic Logics Part I: The Propositional Case
• A dynamic logic for acting, sensing, and planning
• Propositional Dynamic Logic with Program Quantifiers

This page was built for publication: Propositional dynamic logic with quantification over regular computation sequences