Global and local graph modifiers

Guillaume Aucher (1, 2) , Philippe Balbiani (1, 3) , Luis Fariñas del Cerro (1, 3) , Andreas Herzig (1, 3)

1 IRIT-LILaC - Logique, Interaction, Langue et Calcul
2 University of Otago [Dunedin, Nouvelle-Zélande]
3 CNRS - Centre National de la Recherche Scientifique

We dene two modal logics that allow to reason about modications of graphs. Both have a universal modal operator. The rst one only involves global modications (of some state label, or of some edge label) everywhere in the graph. The second one also allows for modications that are local to states. The global version generalizes logics of public announcements and public assignments, as well as a logic of preference modication 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 modiers. We then show that adding local modiers dramatically increases the power of the logic: the logic of global and local modiers is undecidable. We nally study its relation with hybrid logic with binder.

Domaines: Logique en informatique [cs.LO]

Guillaume Aucher, Philippe Balbiani, Luis Fariñas del Cerro, Andreas Herzig. Global and local graph modifiers. Electronic Notes in Theoretical Computer Science, 2009, Proceedings of the 5th Workshop on Methods for Modalities (M4M5 2007), 231, ⟨10.1016/j.entcs.2009.02.042⟩. ⟨inria-00556034⟩