Michael Thomas

47 papers A* 1A 2B 7C 2Journal 31Unranked 3
YearRankTypeTitle / Venue / Authors
2015 J jnl
Erratum: The Complexity of Satisfiability for Fragments of CTL and CTL
Int. J. Found. Comput. Sci.
Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk
2015 J jnl
On the parameterized complexity of non-monotonic logics.
Arch. Math. Log.
Arne Meier, Irina Schindler, Johannes Schmidt, Michael Thomas, Heribert Vollmer
2013 J jnl
Verifying proofs in constant depth.
ACM Trans. Comput. Theory
Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer
2012 J jnl
Complexity Classifications for Propositional Abduction in Post's Framework.
J. Log. Comput.
Nadia Creignou, Johannes Schmidt, Michael Thomas
2012 J jnl
Counting classes and the fine structure between NC
Theor. Comput. Sci.
Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer
2012 C conf
On the Parameterized Complexity of Default Logic and Autoepistemic Logic.
LATA
Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer
2012 J jnl
On the applicability of Post's lattice.
Inf. Process. Lett.
Michael Thomas
2012 J jnl
The Complexity of Circumscriptive Inference in Post's Lattice.
Theory Comput. Syst.
Michael Thomas
2012 J jnl
The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers
CoRR
Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Felix Weiss
2012 B conf
The Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers.
Advances in Modal Logic
Stefan Göller, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Felix Weiß
2012 J jnl
The Complexity of Reasoning for Fragments of Autoepistemic Logic.
ACM Trans. Comput. Log.
Nadia Creignou, Arne Meier, Heribert Vollmer, Michael Thomas
2012 J jnl
The complexity of reasoning for fragments of default logic.
J. Log. Comput.
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer
2012 J jnl
Verifying Proofs in Constant Depth.
Electron. Colloquium Comput. Complex.
Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer
2011 J jnl
Complexity of logic-based argumentation in Post's framework.
Argument Comput.
Nadia Creignou, Johannes Schmidt, Michael Thomas, Stefan Woltran
2011 J jnl
Model Checking CTL is Almost Always Inherently Sequential
Log. Methods Comput. Sci.
Olaf Beyersdorff, Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Heribert Vollmer
2011 J jnl
On the Parameterized Complexity of Default Logic and Autoepistemic Logic
CoRR
Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer
2011 J jnl
Proof complexity of propositional default logic.
Arch. Math. Log.
Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer
2011 B conf
Verifying Proofs in Constant Depth.
MFCS
Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer
2010 J jnl
Complexity Classifications for Propositional Abduction in Post's Framework
CoRR
Nadia Creignou, Johannes Schmidt, Michael Thomas
2010 J jnl
Complexity of Non-Monotonic Logics
CoRR
Michael Thomas, Heribert Vollmer
2010 A* conf
Complexity of Propositional Abduction for Restricted Sets of Boolean Functions.
KR
Nadia Creignou, Johannes Schmidt, Michael Thomas
2010 J jnl
Complexity of non-monotonic logics.
Bull. EATCS
Michael Thomas, Heribert Vollmer
2010 B conf
Counting Classes and the Fine Structure between NC
MFCS
Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer
2010 J jnl
Counting Classes and the Fine Structure between NC
Electron. Colloquium Comput. Complex.
Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer
2010 J jnl
Extensional Uniformity for Boolean Circuits.
SIAM J. Comput.
Pierre McKenzie, Michael Thomas, Heribert Vollmer
2010 J jnl
On the Applicability of Post's Lattice
CoRR
Michael Thomas
2010 — —
On the complexity of fragments of nonmonotonic logics.
Michael Thomas
2010 — conf
Proof Complexity of Propositional Default Logic.
Circuits, Logic, and Games
Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer
2010 A conf
Proof Complexity of Propositional Default Logic.
SAT
Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer
2010 B conf
Sets of Boolean Connectives That Make Argumentation Easier.
JELIA
Nadia Creignou, Johannes Schmidt, Michael Thomas, Stefan Woltran
2010 J jnl
The Complexity of Reasoning for Fragments of Autoepistemic Logic
CoRR
Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer
2010 — conf
The Complexity of Reasoning for Fragments of Autoepistemic Logic.
Circuits, Logic, and Games
Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer
2010 J jnl
The complexity of satisfiability for fragments of hybrid logic - Part I.
J. Appl. Log.
Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss
2009 J jnl
Complexity of Propositional Abduction for Restricted Sets of Boolean Functions
CoRR
Nadia Creignou, Johannes Schmidt, Michael Thomas
2009 C conf
Model Checking CTL is Almost Always Inherently Sequential.
TIME
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk, Thomas Schneider
2009 B conf
The Complexity of Circumscriptive Inference in Post's Lattice.
LPNMR
Michael Thomas
2009 A conf
The Complexity of Reasoning for Fragments of Default Logic.
SAT
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer
2009 J jnl
The Complexity of Satisfiability for Fragments of CTL and CTL*.
Int. J. Found. Comput. Sci.
Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk
2009 J jnl
The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I
CoRR
Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss
2009 B conf
The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I.
MFCS
Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss
2009 J jnl
The complexity of propositional implication.
Inf. Process. Lett.
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer
2008 J jnl
Extensional Uniformity for Boolean Circuits
CoRR
Pierre McKenzie, Michael Thomas, Heribert Vollmer
2008 B conf
Extensional Uniformity for Boolean Circuits.
CSL
Pierre McKenzie, Michael Thomas, Heribert Vollmer
2008 J jnl
The Complexity of Propositional Implication
CoRR
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer
2008 J jnl
The Complexity of Reasoning for Fragments of Default Logic
CoRR
Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer
2008 — conf
The Complexity of Satisfiability for Fragments of CTL and CTL
RP
Arne Meier, Martin Mundhenk, Michael Thomas, Heribert Vollmer
2007 J jnl
Neural Networks and Optimization Algorithms Applied for Construction of Low Noise Tread Profiles.
Cybern. Syst.
Matthias Becker, Helena Szczerbicka, Michael Thomas