Michael Thomas

According to our database, Michael Thomas authored at least 25 papers between 2007 and 2015.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2015

Erratum: The Complexity of Satisfiability for Fragments of CTL and CTL^⋆.

Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk

Int. J. Found. Comput. Sci., 2015

On the parameterized complexity of non-monotonic logics.

Arne Meier, Irina Schindler, Johannes Schmidt, Michael Thomas, Heribert Vollmer

Arch. Math. Log., 2015

2012

Complexity Classifications for Propositional Abduction in Post's Framework.

Nadia Creignou, Johannes Schmidt, Michael Thomas

J. Log. Comput., 2012

On the applicability of Post's lattice.

Michael Thomas

Inf. Process. Lett., 2012

Verifying Proofs in Constant Depth.

Olaf Beyersdorff, Samir Datta, Andreas Krebs, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer

Electron. Colloquium Comput. Complex., 2012

On the Parameterized Complexity of Default Logic and Autoepistemic Logic.

Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer

Proceedings of the Language and Automata Theory and Applications, 2012

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ß

Proceedings of the Advances in Modal Logic 9, 2012

2011

Complexity of logic-based argumentation in Post's framework.

Nadia Creignou, Johannes Schmidt, Michael Thomas, Stefan Woltran

Argument Comput., 2011

Verifying Proofs in Constant Depth.

Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer

Proceedings of the Mathematical Foundations of Computer Science 2011, 2011

2010

On the complexity of fragments of nonmonotonic logics.

Michael Thomas

PhD thesis, 2010

Complexity of non-monotonic logics.

Michael Thomas, Heribert Vollmer

Bull. EATCS, 2010

Counting Classes and the Fine Structure between NC¹ and L.

Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer

Proceedings of the Mathematical Foundations of Computer Science 2010, 2010

Complexity of Propositional Abduction for Restricted Sets of Boolean Functions.

Nadia Creignou, Johannes Schmidt, Michael Thomas

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, 2010

Sets of Boolean Connectives That Make Argumentation Easier.

Nadia Creignou, Johannes Schmidt, Michael Thomas, Stefan Woltran

Proceedings of the Logics in Artificial Intelligence - 12th European Conference, 2010

The Complexity of Reasoning for Fragments of Autoepistemic Logic.

Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer

Proceedings of the Circuits, Logic, and Games, 07.02. - 12.02.2010, 2010

Proof Complexity of Propositional Default Logic.

Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer

Proceedings of the Circuits, Logic, and Games, 07.02. - 12.02.2010, 2010

2009

The complexity of propositional implication.

Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer

Inf. Process. Lett., 2009

The Complexity of Satisfiability for Fragments of CTL and CTL*.

Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk

Int. J. Found. Comput. Sci., 2009

Model Checking CTL is Almost Always Inherently Sequential.

Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk, Thomas Schneider

Proceedings of the TIME 2009, 2009

The Complexity of Reasoning for Fragments of Default Logic.

Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer

Proceedings of the Theory and Applications of Satisfiability Testing, 2009

The Complexity of Satisfiability for Fragments of Hybrid Logic-Part I.

Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

The Complexity of Circumscriptive Inference in Post's Lattice.

Michael Thomas

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2009

2008

The Complexity of Satisfiability for Fragments of CTL and CTL^*.

Arne Meier, Martin Mundhenk, Michael Thomas, Heribert Vollmer

Proceedings of the Second Workshop on Reachability Problems in Computational Models, 2008

Extensional Uniformity for Boolean Circuits.

Pierre McKenzie, Michael Thomas, Heribert Vollmer

Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

2007

Neural Networks and Optimization Algorithms Applied for Construction of Low Noise Tread Profiles.

Matthias Becker, Helena Szczerbicka, Michael Thomas

Cybern. Syst., 2007