An internal semantics for modal logic
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
The logic of public announcements, common knowledge, and private suspicions
TARK '98 Proceedings of the 7th conference on Theoretical aspects of rationality and knowledge
Dynamic epistemic logic with assignment
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Journal of Logic and Computation
A dynamic logic for termgraph rewriting
ICGT'10 Proceedings of the 5th international conference on Graph transformations
| Hi-index | 0.00 |
We define two modal logics that allow to reason about modifications of graphs. Both have a universal modal operator. The first one only involves global modifications (of some state label, or of some edge label) everywhere in the graph. The second one also allows for modifications that are local to states. The global version generalizes logics of public announcements and public assignments, as well as a logic of preference modification introduced by van Benthem et Liu. By means of reduction axioms we show that it is just as expressive as the underlying logic without global modifiers. We then show that adding local modifiers dramatically increases the power of the logic: the logic of global and local modifiers is undecidable. We finally study its relation with hybrid logic with binder.