Michael Thomas

Publication Activity (10 Years)

Years Active: 2007-2015
Publications (10 Years): 0

Top Venues

J. Log. Comput.

ACM Trans. Comput. Theory

CoRR

Theory Comput. Syst.

University of Hanover (PHD)

Education History

University of Hanover

PHD

Publications

Arne Meier, Irina Schindler, Johannes Schmidt, Michael Thomas, Heribert Vollmer
On the parameterized complexity of non-monotonic logics. Arch. Math. Log. 54 (5-6) (2015)
Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk
. Int. J. Found. Comput. Sci. 26 (8) (2015)
Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer
Verifying proofs in constant depth. ACM Trans. Comput. Theory 5 (1) (2013)
Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer
On the Parameterized Complexity of Default Logic and Autoepistemic Logic. LATA (2012)
Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Felix Weiss
The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers CoRR (2012)
Nadia Creignou, Johannes Schmidt, Michael Thomas
Complexity Classifications for Propositional Abduction in Post's Framework. J. Log. Comput. 22 (5) (2012)
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer
The complexity of reasoning for fragments of default logic. J. Log. Comput. 22 (3) (2012)
Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Felix Weiß
The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers. Advances in Modal Logic (2012)
Nadia Creignou, Arne Meier, Heribert Vollmer, Michael Thomas
The Complexity of Reasoning for Fragments of Autoepistemic Logic. ACM Trans. Comput. Log. 13 (2) (2012)
Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer
Verifying Proofs in Constant Depth. Electron. Colloquium Comput. Complex. 19 (2012)
Michael Thomas
The Complexity of Circumscriptive Inference in Post's Lattice. Theory Comput. Syst. 50 (3) (2012)
Michael Thomas
On the applicability of Post's lattice. Inf. Process. Lett. 112 (10) (2012)
Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer
and L. Theor. Comput. Sci. 417 (2012)
Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer
Verifying Proofs in Constant Depth. MFCS (2011)
Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer
On the Parameterized Complexity of Default Logic and Autoepistemic Logic CoRR (2011)
Olaf Beyersdorff, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Heribert Vollmer
Model Checking CTL is Almost Always Inherently Sequential Log. Methods Comput. Sci. 7 (2) (2011)
Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer
Proof complexity of propositional default logic. Arch. Math. Log. 50 (7-8) (2011)
Nadia Creignou, Johannes Schmidt, Michael Thomas, Stefan Woltran
Complexity of logic-based argumentation in Post's framework. Argument Comput. 2 (2-3) (2011)
Michael Thomas, Heribert Vollmer
Complexity of non-monotonic logics. Bull. EATCS 102 (2010)
Pierre McKenzie, Michael Thomas, Heribert Vollmer
Extensional Uniformity for Boolean Circuits. SIAM J. Comput. 39 (7) (2010)
Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer
Proof Complexity of Propositional Default Logic. Circuits, Logic, and Games (2010)
Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer
and L. Electron. Colloquium Comput. Complex. 17 (2010)
Michael Thomas
On the Applicability of Post's Lattice CoRR (2010)
Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss
The complexity of satisfiability for fragments of hybrid logic - Part I. J. Appl. Log. 8 (4) (2010)
Nadia Creignou, Johannes Schmidt, Michael Thomas, Stefan Woltran
Sets of Boolean Connectives That Make Argumentation Easier. JELIA (2010)
Michael Thomas, Heribert Vollmer
Complexity of Non-Monotonic Logics CoRR (2010)
Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer
The Complexity of Reasoning for Fragments of Autoepistemic Logic. Circuits, Logic, and Games (2010)
Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer
The Complexity of Reasoning for Fragments of Autoepistemic Logic CoRR (2010)
Nadia Creignou, Johannes Schmidt, Michael Thomas
Complexity of Propositional Abduction for Restricted Sets of Boolean Functions. KR (2010)
Nadia Creignou, Johannes Schmidt, Michael Thomas
Complexity Classifications for Propositional Abduction in Post's Framework CoRR (2010)
Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer
and L. MFCS (2010)
Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer
Proof Complexity of Propositional Default Logic. SAT (2010)
Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk
The Complexity of Satisfiability for Fragments of CTL and CTL*. Int. J. Found. Comput. Sci. 20 (5) (2009)
Michael Thomas
The Complexity of Circumscriptive Inference in Post's Lattice. LPNMR (2009)
Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss
The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I CoRR (2009)
Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss
The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I. MFCS (2009)
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer
The Complexity of Reasoning for Fragments of Default Logic. SAT (2009)
Nadia Creignou, Johannes Schmidt, Michael Thomas
Complexity of Propositional Abduction for Restricted Sets of Boolean Functions CoRR (2009)
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer
The complexity of propositional implication. Inf. Process. Lett. 109 (18) (2009)
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk, Thomas Schneider
Model Checking CTL is Almost Always Inherently Sequential. TIME (2009)
Pierre McKenzie, Michael Thomas, Heribert Vollmer
Extensional Uniformity for Boolean Circuits CoRR (2008)
Pierre McKenzie, Michael Thomas, Heribert Vollmer
Extensional Uniformity for Boolean Circuits. CSL (2008)
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer
The Complexity of Propositional Implication CoRR (2008)
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer
The Complexity of Reasoning for Fragments of Default Logic CoRR (2008)
Arne Meier, Martin Mundhenk, Michael Thomas, Heribert Vollmer
. Electron. Notes Theor. Comput. Sci. 223 (2008)
Matthias Becker, Helena Szczerbicka, Michael Thomas
Neural Networks and Optimization Algorithms Applied for Construction of Low Noise Tread Profiles. Cybern. Syst. 38 (5) (2007)

Michael Thomas.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Michael Thomas