default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael Thomas 0001
Person information
- affiliation: Leibniz Universität Hannover, Germany
Other persons with the same name
- Michael Thomas — disambiguation page
- Michael Thomas 0002 — California Institute of Technology, Pasadena, USA
- Michael Thomas 0003 — Montana State University
- Michael Thomas 0004 — University of Siegen, Germany
- Michael Thomas 0005 — Western Carolina University, Cullowhee, NC, USA
- Michael Thomas 0006 — Australian National University, Canberra, Australia
- Michael Thomas 0007 — Forensic Response Section, South Australia Police, Adelaide
- Michael Thomas 0008 — National Guard Bureau, Atlanta, GA, USA
- Michael Thomas 0009 — Drexel University, Philadelphia, USA
- Michael Thomas 0010 — University of Duisburg-Essen, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2010
[b1]Michael Thomas:
On the complexity of fragments of nonmonotonic logics. University of Hanover, 2010, ISBN 978-3-86955-571-3, pp. 1-125
Journal Articles
- 2015
- [j18]Arne Meier
, Irina Schindler, Johannes Schmidt, Michael Thomas, Heribert Vollmer:
On the parameterized complexity of non-monotonic logics. Arch. Math. Log. 54(5-6): 685-710 (2015) - [j17]Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk:
Erratum: The Complexity of Satisfiability for Fragments of CTL and CTL⋆. Int. J. Found. Comput. Sci. 26(8): 1189- (2015) - 2013
- [j16]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): 2:1-2:23 (2013) - 2012
- [j15]Michael Thomas:
On the applicability of Post's lattice. Inf. Process. Lett. 112(10): 386-391 (2012) - [j14]Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer:
The complexity of reasoning for fragments of default logic. J. Log. Comput. 22(3): 587-604 (2012) - [j13]Nadia Creignou, Johannes Schmidt, Michael Thomas:
Complexity Classifications for Propositional Abduction in Post's Framework. J. Log. Comput. 22(5): 1145-1170 (2012) - [j12]Michael Thomas:
The Complexity of Circumscriptive Inference in Post's Lattice. Theory Comput. Syst. 50(3): 401-419 (2012) - [j11]Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer:
Counting classes and the fine structure between NC1 and L. Theor. Comput. Sci. 417: 36-49 (2012) - [j10]Nadia Creignou, Arne Meier, Heribert Vollmer, Michael Thomas:
The Complexity of Reasoning for Fragments of Autoepistemic Logic. ACM Trans. Comput. Log. 13(2): 17:1-17:22 (2012) - 2011
- [j9]Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer:
Proof complexity of propositional default logic. Arch. Math. Log. 50(7-8): 727-742 (2011) - [j8]Nadia Creignou, Johannes Schmidt, Michael Thomas, Stefan Woltran:
Complexity of logic-based argumentation in Post's framework. Argument Comput. 2(2-3): 107-129 (2011) - [j7]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) - 2010
- [j6]Michael Thomas, Heribert Vollmer:
Complexity of non-monotonic logics. Bull. EATCS 102: 53-82 (2010) - [j5]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): 409-421 (2010) - [j4]Pierre McKenzie, Michael Thomas, Heribert Vollmer:
Extensional Uniformity for Boolean Circuits. SIAM J. Comput. 39(7): 3186-3206 (2010) - 2009
- [j3]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): 901-918 (2009) - [j2]Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer:
The complexity of propositional implication. Inf. Process. Lett. 109(18): 1071-1077 (2009) - 2007
- [j1]Matthias Becker, Helena Szczerbicka, Michael Thomas:
Neural Networks and Optimization Algorithms Applied for Construction of Low Noise Tread Profiles. Cybern. Syst. 38(5): 535-548 (2007)
Conference and Workshop Papers
- 2012
- [c13]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: 261-278 - [c12]Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer:
On the Parameterized Complexity of Default Logic and Autoepistemic Logic. LATA 2012: 389-400 - 2011
- [c11]Olaf Beyersdorff, Samir Datta, Meena Mahajan, Gido Scharfenberger-Fabian, Karteek Sreenivasaiah, Michael Thomas, Heribert Vollmer:
Verifying Proofs in Constant Depth. MFCS 2011: 84-95 - 2010
- [c10]Nadia Creignou, Johannes Schmidt, Michael Thomas, Stefan Woltran:
Sets of Boolean Connectives That Make Argumentation Easier. JELIA 2010: 117-129 - [c9]Nadia Creignou, Johannes Schmidt, Michael Thomas:
Complexity of Propositional Abduction for Restricted Sets of Boolean Functions. KR 2010 - [c8]Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer:
Counting Classes and the Fine Structure between NC1 and L. MFCS 2010: 306-317 - [c7]Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer:
Proof Complexity of Propositional Default Logic. SAT 2010: 30-43 - 2009
- [c6]Michael Thomas:
The Complexity of Circumscriptive Inference in Post's Lattice. LPNMR 2009: 290-302 - [c5]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: 587-599 - [c4]Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer:
The Complexity of Reasoning for Fragments of Default Logic. SAT 2009: 51-64 - [c3]Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer, Martin Mundhenk, Thomas Schneider:
Model Checking CTL is Almost Always Inherently Sequential. TIME 2009: 21-28 - 2008
- [c2]Pierre McKenzie, Michael Thomas, Heribert Vollmer:
Extensional Uniformity for Boolean Circuits. CSL 2008: 64-78 - [c1]Arne Meier, Martin Mundhenk, Michael Thomas, Heribert Vollmer:
The Complexity of Satisfiability for Fragments of CTL and CTL*. RP 2008: 201-213
Informal and Other Publications
- 2012
- [i15]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 abs/1204.1196 (2012) - [i14]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. TR12 (2012) - 2011
- [i13]Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer:
On the Parameterized Complexity of Default Logic and Autoepistemic Logic. CoRR abs/1110.0623 (2011) - 2010
- [i12]Olaf Beyersdorff, Arne Meier, Sebastian Müller, Michael Thomas, Heribert Vollmer:
Proof Complexity of Propositional Default Logic. Circuits, Logic, and Games 2010 - [i11]Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer:
The Complexity of Reasoning for Fragments of Autoepistemic Logic. Circuits, Logic, and Games 2010 - [i10]Nadia Creignou, Arne Meier, Michael Thomas, Heribert Vollmer:
The Complexity of Reasoning for Fragments of Autoepistemic Logic. CoRR abs/1006.0220 (2010) - [i9]Nadia Creignou, Johannes Schmidt, Michael Thomas:
Complexity Classifications for Propositional Abduction in Post's Framework. CoRR abs/1006.4923 (2010) - [i8]Michael Thomas:
On the Applicability of Post's Lattice. CoRR abs/1007.2924 (2010) - [i7]Michael Thomas, Heribert Vollmer:
Complexity of Non-Monotonic Logics. CoRR abs/1009.1990 (2010) - [i6]Samir Datta, Meena Mahajan, B. V. Raghavendra Rao, Michael Thomas, Heribert Vollmer:
Counting Classes and the Fine Structure between NC1 and L. Electron. Colloquium Comput. Complex. TR10 (2010) - 2009
- [i5]Arne Meier, Martin Mundhenk, Thomas Schneider, Michael Thomas, Volker Weber, Felix Weiss:
The Complexity of Satisfiability for Fragments of Hybrid Logic -- Part I. CoRR abs/0906.1489 (2009) - [i4]Nadia Creignou, Johannes Schmidt, Michael Thomas:
Complexity of Propositional Abduction for Restricted Sets of Boolean Functions. CoRR abs/0912.3134 (2009) - 2008
- [i3]Pierre McKenzie, Michael Thomas, Heribert Vollmer:
Extensional Uniformity for Boolean Circuits. CoRR abs/0805.4072 (2008) - [i2]Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer:
The Complexity of Reasoning for Fragments of Default Logic. CoRR abs/0808.3884 (2008) - [i1]Olaf Beyersdorff, Arne Meier, Michael Thomas, Heribert Vollmer:
The Complexity of Propositional Implication. CoRR abs/0811.0959 (2008)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
