Decidability and Expressivity of Ockhamist Propositional Dynamic Logics
From MaRDI portal
Publication:2835868
DOI10.1007/978-3-319-48758-8_10zbMath1483.68371OpenAlexW2540194349MaRDI QIDQ2835868
Joseph Boudou, Emiliano Lorini
Publication date: 30 November 2016
Published in: Logics in Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: http://oatao.univ-toulouse.fr/18932/1/boudou_18932.pdf
Logic in artificial intelligence (68T27) Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Propositional dynamic logic of regular programs
- An extended branching-time Ockhamist temporal logic
- CTL\(^*\) and ECTL\(^*\) as fragments of the modal \(\mu\)-calculus
- An axiomatization of full Computation Tree Logic
- Ockhamist Propositional Dynamic Logic: A Natural Link between PDL and CTL*
- A Tableau for Bundled CTL
- Alternating-time temporal logic
- Propositional dynamic logic of looping and converse is elementarily decidable
- Deciding full branching time logic
- The Complexity of Tree Automata and Logics of Programs
- Branching-time logic with quantification over branches: The point of view of modal logic