2 citations · 2 across the 3 of their papers we have counts for
3 papers
cs.LO2014★ 2 cited
Parameterized Complexity of CTL: A Generalization of Courcelle's Theorem
Martin Lück, Arne Meier, Irina Schindler
We present an almost complete classification of the parameterized complexity of all operator fragments of the satisfiability problem in computation tree logic CTL. The investigated…
cs.LO2012
Generalized Complexity of ALC Subsumption
Arne Meier
The subsumption problem with respect to terminologies in the description logic ALC is EXPTIME-complete. We investigate the computational complexity of fragments of this problem by…
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…