A Game Theoretic Approach to the Analysis of Dynamic Networks
Electronic Notes in Theoretical Computer Science (ENTCS)
Acts of commanding and changing obligations
CLIMA VII'06 Proceedings of the 7th international conference on Computational logic in multi-agent systems
Logical dynamics of commands and obligations
JSAI'06 Proceedings of the 20th annual conference on New frontiers in artificial intelligence
On the complexity of reasoning about dynamic policies
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Connectivity games over dynamic networks
Theoretical Computer Science
| Hi-index | 0.01 |
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.