Johannes Schmidt

According to our database, Johannes Schmidt authored at least 20 papers between 2010 and 2023.

Collaborative distances:

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

2023

Parameterized Complexity of Logic-based Argumentation in Schaefer's Framework.

Yasir Mahmood, Arne Meier, Johannes Schmidt

ACM Trans. Comput. Log., 2023

Complexity of Reasoning with Cardinality Minimality Conditions.

Nadia Creignou, Frédéric Olive, Johannes Schmidt

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2021

The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems.

Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman

Theor. Comput. Sci., 2021

Parameterized complexity of abduction in Schaefer's framework.

Yasir Mahmood, Arne Meier, Johannes Schmidt

J. Log. Comput., 2021

2020

Parameterised Complexity of Abduction in Schaefer's Framework.

Yasir Mahmood, Arne Meier, Johannes Schmidt

Proceedings of the Logical Foundations of Computer Science - International Symposium, 2020

2019

Parameterised Complexity for Abduction.

Yasir Mahmood, Arne Meier, Johannes Schmidt

CoRR, 2019

2017

Paradigms for Parameterized Enumeration.

Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer

Theory Comput. Syst., 2017

The Weight in Enumeration.

Johannes Schmidt

Proceedings of the Language and Automata Theory and Applications, 2017

2015

On the parameterized complexity of non-monotonic logics.

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

Arch. Math. Log., 2015

2014

Complexity Classifications for Logic-Based Argumentation.

Nadia Creignou, Uwe Egly, Johannes Schmidt

ACM Trans. Comput. Log., 2014

Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis.

Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman

Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013

The Complexity of Abduction for Equality Constraint Languages.

Johannes Schmidt, Michal Wrona

Proceedings of the Computer Science Logic 2013 (CSL 2013), 2013

2012

Complexity classifications for nonmonotonic reasoning and enumeration.

Johannes Schmidt

PhD thesis, 2012

Complexity Classifications for Propositional Abduction in Post's Framework.

Nadia Creignou, Johannes Schmidt, Michael Thomas

J. Log. Comput., 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

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

Nadia Creignou, Uwe Egly, Johannes Schmidt

Proceedings of the Computational Models of Argument, 2012

2011

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

Nadia Creignou, Johannes Schmidt, Michael Thomas, Stefan Woltran

Argument Comput., 2011

Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight.

Nadia Creignou, Frédéric Olive, Johannes Schmidt

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

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