Johannes Schmidt

ORCID

Publication Activity (10 Years)

Years Active: 2009-2023
Publications (10 Years): 13

Top Venues

CoRR

ACM Trans. Comput. Log.

AAAI

LFCS

University of Hanover (PHD)

Education History

University of Hanover

PHD

Publications

Nadia Creignou, Frédéric Olive, Johannes Schmidt
Complexity of Reasoning with Cardinality Minimality Conditions. CoRR (2023)
Yasir Mahmood, Arne Meier, Johannes Schmidt
Parameterized Complexity of Logic-based Argumentation in Schaefer's Framework. ACM Trans. Comput. Log. 24 (3) (2023)
Nadia Creignou, Frédéric Olive, Johannes Schmidt
Complexity of Reasoning with Cardinality Minimality Conditions. AAAI (2023)
Yasir Mahmood, Arne Meier, Johannes Schmidt
Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework. CoRR (2021)
Yasir Mahmood, Arne Meier, Johannes Schmidt
Parameterized complexity of abduction in Schaefer's framework. J. Log. Comput. 31 (1) (2021)
Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman
The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems. Theor. Comput. Sci. 892 (2021)
Yasir Mahmood, Arne Meier, Johannes Schmidt
Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework. AAAI (2021)
Yasir Mahmood, Arne Meier, Johannes Schmidt
Parameterised Complexity of Abduction in Schaefer's Framework. LFCS (2020)
Yasir Mahmood, Arne Meier, Johannes Schmidt
Parameterised Complexity for Abduction. CoRR (2019)
Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer
Paradigms for Parameterized Enumeration. Theory Comput. Syst. 60 (4) (2017)
Johannes Schmidt
The Weight in Enumeration. LATA (2017)
Johannes Schmidt
The Weight in Enumeration. CoRR (2016)
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)
Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman
Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis. CoRR (2014)
Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman
Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis. MFCS (2) (2014)
Nadia Creignou, Uwe Egly, Johannes Schmidt
Complexity Classifications for Logic-Based Argumentation. ACM Trans. Comput. Log. 15 (3) (2014)
Nadia Creignou, Uwe Egly, Johannes Schmidt
Complexity Classifications for logic-based Argumentation CoRR (2013)
Johannes Schmidt, Michal Wrona
The Complexity of Abduction for Equality Constraint Languages. CSL (2013)
Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer
Paradigms for Parameterized Enumeration. MFCS (2013)
Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer
Paradigms for Parameterized Enumeration. CoRR (2013)
Nadia Creignou, Uwe Egly, Johannes Schmidt
Complexity of logic-based argumentation in Schaefer's framework. COMMA (2012)
Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer
On the Parameterized Complexity of Default Logic and Autoepistemic Logic. LATA (2012)
Nadia Creignou, Johannes Schmidt, Michael Thomas
Complexity Classifications for Propositional Abduction in Post's Framework. J. Log. Comput. 22 (5) (2012)
Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer
On the Parameterized Complexity of Default Logic and Autoepistemic Logic CoRR (2011)
Nadia Creignou, Johannes Schmidt, Michael Thomas, Stefan Woltran
Complexity of logic-based argumentation in Post's framework. Argument Comput. 2 (2-3) (2011)
Nadia Creignou, Frédéric Olive, Johannes Schmidt
Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight. SAT (2011)
Nadia Creignou, Johannes Schmidt, Michael Thomas, Stefan Woltran
Sets of Boolean Connectives That Make Argumentation Easier. JELIA (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)
Nadia Creignou, Johannes Schmidt, Michael Thomas
Complexity of Propositional Abduction for Restricted Sets of Boolean Functions CoRR (2009)

Johannes Schmidt.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Johannes Schmidt