Modal logics of sabotage revisited

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 chara...

Full description

Saved in:
Bibliographic Details
Published inJournal of logic and computation Vol. 28; no. 2; pp. 269 - 303
Main Authors Aucher, Guillaume, Benthem, Johan van, Grossi, Davide
Format Journal Article
LanguageEnglish
Published Oxford University Press (OUP) 06.03.2018
Subjects
Artificial Intelligence
Computer Science
Logic
Logic in Computer Science
Mathematics
Online AccessGet full text
ISSN0955-792X
1465-363X
1465-363X
DOI10.1093/logcom/exx034

Cover

More Information
Summary: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.
ISSN:0955-792X
1465-363X
1465-363X
DOI:10.1093/logcom/exx034