Learn More
We study dynamic modal operators that can change the model during the evaluation of a formula. In particular, we extend the basic modal language with modalities that are able to swap, delete or add pairs of related elements of the domain, while traversing an edge of the accessibility relation. We study these languages together with the sabotage modal logic,(More)
We give sound and complete axiomatizations for XPath with data tests by 'equality' or 'inequality', and containing the single 'child' axis. This data-aware logic predicts over data trees, which are tree-like structures whose every node contains a label from a finite alphabet and a data value from an infinite domain. The language allows us to compare data(More)
We investigate dynamic modal operators that can change the model during evaluation. We define the logic SL by extending the basic modal language with the ♦ modality, which is a diamond operator that in addition has the ability to invert pairs of related elements in the domain while traversing an edge of the accessibility relation. SL is very expressive: it(More)
Modal logics are appropriate to describe properties of graphs. But usually these are static properties. We investigate dynamic modal operators that can change the model during evaluation. We define the logic SL by extending the basic modal language with the ✸ modality, which is a diamond operator that has the ability to invert pairs of related elements in(More)