Global and local graph modifiers

Abstract : 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.
Document type :
Journal articles
Liste complète des métadonnées

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/inria-00556034
Contributor : Guillaume Aucher <>
Submitted on : Saturday, January 15, 2011 - 1:40:25 AM
Last modification on : Friday, April 19, 2019 - 8:00:03 AM
Document(s) archivé(s) le : Saturday, April 16, 2011 - 2:28:06 AM

File

M4M.pdf
Publisher files allowed on an open archive

Identifiers

  • HAL Id : inria-00556034, version 1

Collections

Citation

Guillaume Aucher, Philippe Balbiani, Luis Farinas del Cerro, Andreas Herzig. Global and local graph modifiers. Electronic Notes in Theoretical Computer Science, Elsevier, 2009. ⟨inria-00556034⟩

Share

Metrics

Record views

190

Files downloads

357