A Reduction from DLP to PDL
The work
| Authors | Stéphane P. Demri |
|---|---|
| Editors | |
| Type | article |
| Year | 2005 |
| Citekey | demri2005reduction |
Where it appeared
| Published in | Journal of Logic and Computation |
|---|---|
| Publisher | Oxford University Press |
| Volume | 15 |
| Issue | 5 |
| Pages | 767--785 |
Identifiers
| DOI | 10.1093/logcom/exi043 |
|---|---|
| OpenAlex | W2149381381 |
Access
| Landing page | https://doi.org/10.1093/logcom/exi043 |
|---|
From OpenAlex, which stores abstracts as an index of words and their positions: what is shown is rebuilt from that, and reads fluently whether or not it is what the author wrote.
Abstract
We present a reduction from a new logic extending van der Meyden's dynamic logic of permission (DLP) into propositional dynamic logic (PDL), providing a 2EXPTIME decision procedure and showing that all the machinery for PDL can be reused for reasoning about dynamic policies. As a side-effect, we establish that DLP is EXPTIME-complete. The logic we introduce extends the logic DLP so that the policy set can be updated depending on its current value and such an update corresponds to add/delete transitions in the model, showing similarities with van Benthem's sabotage modal logic.
How it got here
| How it got here | agent via openalex |
|---|---|
| Added | 2026-10-24 16:12 UTC |
| Not denied by | a person 2026-10-29 17:12 UTC |
Cite it as
@article{demri2005reduction,
title = {A Reduction from DLP to PDL},
author = {Stéphane P. Demri},
year = {2005},
journal = {Journal of Logic and Computation},
publisher = {Oxford University Press},
volume = {15},
number = {5},
pages = {767--785},
doi = {10.1093/logcom/exi043},
}
This record lives at https://refs.drheap.org/demri2005reduction/ and will keep doing so.