A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf
.
Model Checking and Satisfiability for Sabotage Modal Logic
[chapter]
2003
Lecture Notes in Computer Science
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
doi:10.1007/978-3-540-24597-1_26
fatcat:ko3yv22t2zcavhs6bknndtgjhi