PDL with negation of atomic programs
From MaRDI portal
Recommendations
Cites work
- An essay in combinatory dynamic logic
- Automata-theoretic techniques for modal logics of programs
- scientific article; zbMATH DE number 4068839 (Why is no real title available?)
- scientific article; zbMATH DE number 1936671 (Why is no real title available?)
- scientific article; zbMATH DE number 795590 (Why is no real title available?)
- scientific article; zbMATH DE number 2196585 (Why is no real title available?)
- Inaccessible worlds
- Modal definability in enriched languages
- Propositional dynamic logic of regular programs
- Reasoning about action and change. A dynamic logic approach
- Using the Universal Modality: Gains and Questions
Cited in
(13)- A Reduction from DLP to PDL
- Algebraic Semantics for Dynamic Dynamic Logic
- Cheap Boolean Role Constructors for Description Logics
- PDL with intersection and converse: satisfiability and infinite-state model checking
- scientific article; zbMATH DE number 3979045 (Why is no real title available?)
- From positive PDL to its non-classical extensions
- \(\mathrm{FO}=\mathrm{FO}^3\) for linear orders with monotone binary relations
- Non-classical PDL on the cheap
- Automated Reasoning
- On the negation of action types: constructive concurrent PDL
- 2-Exp Time lower bounds for propositional dynamic logics with intersection
- scientific article; zbMATH DE number 2209347 (Why is no real title available?)
- Derivatives on graphs for the positive calculus of relations with transitive closure
This page was built for publication: PDL with negation of atomic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3647227)