22 search results - page 5 / 5 » A Lower Complexity Bound for Propositional Dynamic Logic wit... |
ICALP
2010
Springer
13 years 7 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...
KR
2004
Springer
13 years 10 months ago
2004
Springer
In this paper, partial knowledge about the possible transitions which can take place in a dynamical environment is represented by a set of pairs of propositional formulae, with th...