CORR
2008
Springer
15 years 13 days ago
2008
Springer
It is well-known that modal satisfiability is PSPACE-complete [Lad77]. However, the complexity may decrease if we restrict the set of propositional operators used. Note that there ...
78
Voted
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
We investigate the parameterized computational complexity of the satisfiability problem for modal logic and attempt to pinpoint relevant structural parameters which cause the probl...