Modal logics of sabotage revisited

  title={Modal logics of sabotage revisited},
  author={Guillaume Aucher and Johan van Benthem and Davide Grossi},
  journal={J. Log. Comput.},
Sabotage modal logic was proposed in 2003 as a format for analysing games that modify graphs they are played on. We investigate some model-theoretic and proof-theoretic aspects of sabotage modal logic, which has come to be viewed as an early dynamic logic of graph change. Our first result is a characterization theorem for sabotage modal logic as a fragment of first-order logic which is invariant with respect to a natural notion of ‘sabotage bisimulation’. Next, we offer a sound and complete… 

Figures and Tables from this paper

Mechanizing Bisimulation Theorems for Relation-Changing Logics in Coq

This work formalizes and verify in the proof assistant Coq, the bisimulation theorems for a particular family of dynamic logics that can change the accessibility relation of a model.

Losing Connection: Modal Logic of Definable Link Deletion

  • Dazhu Li
  • Computer Science
    J. Log. Comput.
  • 2020
In this article, we start with a two-player game that models communication under adverse circumstances in everyday life and study it from the perspective of a modal logic of graphs, where links can


This work provides a complete Hilbert-style axiomatization for the logic of stepwise removal in a hybrid language enriched with nominals and public announcement operators and analyzes its expressive power and proves a bisimulation characterization theorem.

Hybrid Sabotage Modal Logic

A new hybrid modal logic HSML is introduced for reasoning about sabotage-style graph games with edge deletions, and a complete Hilbert-style axiomatization is provided to extend the completeness analysis to protocol models with restrictions on available edge deletion.

Satisfiability for relation-changing logics

It is shown that relation-changing modal logics, extensions of the basic modal logic with dynamic operators that modify the accessibility relation of a model during the evaluation of a formula, can be translated into hybrid logic and satisfiability is, in general, undecidable.

Modal Logics with Composition on Finite Forests: Expressivity and Complexity

It is shown that ML(|) is as expressive as the graded modal logic GML (on trees) whereas ML(*) is strictly less expressive than GML, a result which is surprising given their relative expressivity.

Why Propositional Quantification Makes Modal and Temporal Logics on Trees Robustly Hard?

It is shown that QCTL restricted to the temporal operator EX is already Tower-hard, which is unexpected as EX can only enforce local properties, and it is proved that the satisfiability problem is AExppol-complete.

Recapturing Dynamic Logic of Relation Changers via Bounded Morphisms

The present contribution shows that a Hilbert-style axiomatization for dynamic logic of relation changers is complete for the standard Kripke semantics not by a well-known rewriting technique but by

The Modal Logics of the Poison Game

The poison game is a two-player zero-sum game played on directed graphs, first introduced by Duchet and Meyniel (1993) in the context of graph theory, where one of the players travels along the edges

Model checking and model synthesisfrom partial models: a logic-based perspective

A general tableaux-style procedure is outlined that solves the problem of unconstrained model synthesis from finite partial models for several well-known modal and temporal logics, incl.



Sabotage Modal Logic: Some Model and Proof Theoretic Aspects

The first contribution is to prove a characterization theorem for sabotage modal logic as the fragment of first-order logic which is invariant with respect to a suitably defined notion of bisimulation.

On the µ-Calculus Augmented with Sabotage

Backup parity games are introduced as an extension of standard parity games where in addition, both players are able to delete edges of the arena and to store, resp.

Model Checking and Satisfiability for Sabotage Modal Logic

It is shown that the formula complexity and the program complexity are linear, resp.

Solving the Sabotage Game Is PSPACE-Hard

The PSPACE-hardness of the sabotage game is established and a modal logic over changing models to express tasks corresponding to the sabotage games is introduced and it is shown that model checking this logic is PSPace-complete.

Relation-changing modal operators

The basic modal language is extended with modalities that are able to delete, add or swap an edge between pairs of elements of the domain and a generic framework is defined to characterize this kind of operations.

Hybrid logics

Moving Arrows and Four Model Checking Results

The basic modal language is extended 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.

Schematic Validity in Dynamic Epistemic Logic: Decidability

Positive answers are obtained for multi-agent PAL, as well as its extension with relativized common knowledge, PAL-RC, and the conceptual significance of substitution failure is discussed.

Proof Analysis in Modal Logic

A general method for generating contraction- and cut-free sequent calculi for a large family of normal modal logics and it can be extended to treat also Gödel–Löb provability logic.

Reactive Kripke Semantics

  • D. Gabbay
  • Computer Science
    Cognitive Technologies
  • 2013
This text offers an extension to the traditional Kripke semantics for non-classical logics by adding the notion of reactivity, and investigates the properties and axiomatisations of this new and most effective semantics.