A Reduction from DLP to PDL

DOI10.1093/logcom/exi043zbMath1092.03016OpenAlexW2149381381MaRDI QIDQ3374102

Stéphane P. 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 complexitydeontic logicpropositional dynamic logiclogic of programsdeletion of states/transitionsdynamic logic of permissionssabotage modal logic

Mathematics Subject Classification ID

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

Related Items (5)

Connectivity games over dynamic networks ⋮ Separation logics and modalities: a survey ⋮ Logical dynamics of some speech acts that affect obligations and preferences ⋮ Dynamic logic of preference upgrade ⋮ A Game Theoretic Approach to the Analysis of Dynamic Networks

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