Order:
  1.  4
    The Complexity of Satisfiability for Fragments of Hybrid Logic—Part I.Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber & Felix Weiss - 2010 - Journal of Applied Logic 8 (4):409-421.
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  2.  38
    Proof Complexity of Propositional Default Logic.Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas & Heribert Vollmer - 2011 - Archive for Mathematical Logic 50 (7-8):727-742.
    Default logic is one of the most popular and successful formalisms for non-monotonic reasoning. In 2002, Bonatti and Olivetti introduced several sequent calculi for credulous and skeptical reasoning in propositional default logic. In this paper we examine these calculi from a proof-complexity perspective. In particular, we show that the calculus for credulous reasoning obeys almost the same bounds on the proof size as Gentzen’s system LK. Hence proving lower bounds for credulous reasoning will be as hard as proving lower bounds (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark  
  3.  3
    The Complexity of Monotone Hybrid Logics Over Linear Frames and the Natural Numbers.Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas & Felix Weiß - 2012 - In Thomas Bolander, Torben Braüner, Silvio Ghilardi & Lawrence Moss (eds.), Advances in Modal Logic, Volume 9. CSLI Publications. pp. 261-278.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark  
  4.  4
    On the Parameterized Complexity of Non-Monotonic Logics.Arne Meier, Irina Schindler, Johannes Schmidt, Michael Thomas & Heribert Vollmer - 2015 - Archive for Mathematical Logic 54 (5-6):685-710.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark