37 citations · 80 across the 29 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
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…