The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I (2009)
Meier, Arne, Mundhenk, Martin, Schneider, Thomas, Thomas, Michael, Weber, Volker, Weiss, Felix
The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this paper, we investigate...
The Complexity of Propositional Implication (2008)
Beyersdorff, Olaf, Meier, Arne, Thomas, Michael, Vollmer, Heribert
The question whether a set of formulae G implies a formula f is fundamental. The present paper studies the complexity of the above implication problem for propositional formulae that are built from a...
The Complexity of Reasoning for Fragments of Default Logic (2008)
Beyersdorff, Olaf, Meier, Arne, Thomas, Michael, Vollmer, Heribert
Default logic was introduced by Reiter in 1980. In 1992, Gottlob classified the complexity of the extension existence problem for propositional default logic as SigmaP2-complete, and the complexity...
6LiD für das polarisierte Target des COMPASS-Experiments / (2001)
Bochum, Universiẗat, Diss., 2001.