A Reduction from DLP to PDL

DOI10.1093/LOGCOM/EXI043MaRDI QIDQ3374102zbMATH OpenOpenAlexFDO

Authors Stéphane Demri

Publication date 9 March 2006

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/c58247fc327d4a31147c0a0e33bbd5e7e507ba91

zbMATH Keywords

computational complexitydeletion of states/transitionsdeontic logicdynamic logic of permissionslogic of programspropositional dynamic logicsabotage modal logic

Mathematics Subject Classification ID

Modal logic (including the logic of norms) (03B45) Logic in computer science (03B70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Logic in artificial intelligence (68T27)

Recommendations

• On the Complexity of Reasoning About Dynamic Policies
• Decision complexity of variants of propositional dynamic logic
• Dynamic logic of propositional assignments: a well-behaved variant of PDL
• Dynamic process logic
• PDL with negation of atomic programs

Cited in

(6)

• Logical dynamics of some speech acts that affect obligations and preferences
• A game theoretic approach to the analysis of dynamic networks
• On the Complexity of Reasoning About Dynamic Policies
• Dynamic logic of preference upgrade
• Connectivity games over dynamic networks
• Separation logics and modalities: a survey

This page was built for publication: A Reduction from DLP to PDL

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3374102)