Model Checking and Satisfiability for Sabotage Modal Logic

  title={Model Checking and Satisfiability for Sabotage Modal Logic},
  author={Christof L{\"o}ding and Philipp Rohde},
We consider the sabotage modal logic SML which was suggested by van Benthem. SML is the modal logic equipped with a ‘transition-deleting’ modality and hence a modal logic over changing models. It was shown that the problem of uniform model checking for this logic is PSPACE-complete. In this paper we show that, on the other hand, the formula complexity and the program complexity are linear, resp., polynomial time. Further we show that SML lacks nice model-theoretic properties such as… CONTINUE READING


Publications referenced by this paper.

Similar Papers

Loading similar papers…