Global and Local Graph Modifiers

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.

[1]  Lawrence S. Moss,et al.  The Logic of Public Announcements and Common Knowledge and Private Suspicions , 1998, TARK.

[2]  Johan van Benthem,et al.  An Essay on Sabotage and Obstruction , 2005, Mechanizing Mathematical Reasoning.

[3]  Alan Bundy,et al.  Constructing Induction Rules for Deductive Synthesis Proofs , 2006, CLASE.

[4]  Alexander K. Petrenko,et al.  Electronic Notes in Theoretical Computer Science , 2009 .

[5]  Jaikumar Radhakrishnan,et al.  FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science , 2004, Lecture Notes in Computer Science.

[6]  Johan van Benthem,et al.  Dynamic logic of preference upgrade , 2007, J. Appl. Non Class. Logics.

[7]  Balder ten Cate,et al.  Hybrid logics , 2007, Handbook of Modal Logic.

[8]  Riccardo Pucella,et al.  Reasoning about Dynamic Policies , 2004, FoSSaCS.

[9]  Ronald Fagin,et al.  An Internal Semantics for Modal Logic: Preliminary Report , 1985, STOC 1985.

[10]  Wiebe van der Hoek,et al.  Dynamic epistemic logic with assignment , 2005, AAMAS '05.

[11]  S. Ramesh,et al.  Foundations of Software Technology and Theoretical Computer Science , 1997, Lecture Notes in Computer Science.

[12]  Barteld P. Kooi,et al.  Expressivity and completeness for public update logics via reduction axioms , 2007, J. Appl. Non Class. Logics.

[13]  Jan A. Plaza,et al.  Logics of public communications , 2007, Synthese.

[14]  Moshe Y. Vardi.  Why is Modal Logic So Robustly Decidable? , 1996, Descriptive Complexity and Finite Models.

[15]  J. Benthem.  One is a Lonely Number: on the logic of communication , 2003 .

[16]  Maarten Marx,et al.  A Road-Map on Complexity for Hybrid Logics , 1999, CSL.

[17]  Mario Rodríguez-Artalejo,et al.  Proceedings of the 8th Annual Conference of the EACSL, Madrid, September 1999 , 1999 .

[18]  Christof Löding,et al.  Model Checking and Satisfiability for Sabotage Modal Logic , 2003, FSTTCS.

[19]  Ronald Fagin,et al.  An internal semantics for modal logic , 1985, STOC '85.

[20]  Anne S. Troelstra.  Changing Modalities , 2000 .