Modal logics of sabotage revisited

Abstract : Sabotage modal logic was proposed in 2003 as a format for analyzing 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 tableau method and its associated labeled sequent calculus for analyzing reasoning in sabotage modal logic. Finally, we identify and briefly explore a number of open research problems concerning sabotage modal logic that illuminate its complexity, placing it within the current landscape of modal logics that analyze model update, and, returning to the original motivation of sabotage, fixed-point logics for network games.
Complete list of metadatas

Cited literature [56 references]  Display  Hide  Download

https://hal.inria.fr/hal-01827076
Contributor : Guillaume Aucher <>
Submitted on : Sunday, July 1, 2018 - 2:30:06 PM
Last modification on : Friday, November 16, 2018 - 1:26:03 AM
Long-term archiving on : Monday, October 1, 2018 - 3:35:11 AM

File

RevisedProof.pdf
Files produced by the author(s)

Identifiers

Citation

Guillaume Aucher, Johan Van Benthem, Davide Grossi. Modal logics of sabotage revisited. Journal of Logic and Computation, Oxford University Press (OUP), 2018, 28 (2), pp.269 - 303. ⟨10.1093/logcom/exx034⟩. ⟨hal-01827076⟩

Share

Metrics

Record views

401

Files downloads

116