93 citations · 122 across the 9 of their papers we have counts for
Showing cs.CCShow all
3 papers · 1 filter
cs.CC2012
The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers
Stefan Göller, Arne Meier, Martin Mundhenk +3
Hybrid logic with binders is an expressive specification language. Its satisfiability problem is undecidable in general. If frames are restricted to N or general linear orders, the…
cs.CC2011★ 2 cited
Intuitionistic implication makes model checking hard
Martin Mundhenk, Felix Weiss
We investigate the complexity of the model checking problem for intuitionistic and modal propositional logics over transitive Kripke models. More specific, we consider intuitionist…
cs.CC2010★ 5 cited
The model checking problem for intuitionistic propositional logic with one variable is AC1-complete
Martin Mundhenk, Felix Weiss
We show that the model checking problem for intuitionistic propositional logic with one variable is complete for logspace-uniform AC1. As basic tool we use the connection between i…