Johannes Schmidt

38 papers A* 5A 2B 3C 3Misc 1Journal 22Unranked 1
YearRankTypeTitle / Venue / Authors
2025 A* conf
A Fine-Grained Complexity View on Propositional Abduction - Algorithms and Lower Bounds.
IJCAI
Victor Lagerkvist, Mohamed Maizia, Johannes Schmidt
2025 J jnl
A Fine-Grained Complexity View on Propositional Abduction - Algorithms and Lower Bounds.
CoRR
Victor Lagerkvist, Mohamed Maizia, Johannes Schmidt
2025 J jnl
Complexity of Faceted Explanations in Propositional Abduction.
CoRR
Johannes Schmidt, Mohamed Maizia, Victor Lagerkvist, Johannes Klaus Fichte
2025 J jnl
Complexity of Faceted Explanations in Propositional Abduction.
Theory Pract. Log. Program.
Johannes Schmidt, Mohamed Maizia, Victor Lagerkvist, Johannes Klaus Fichte
2025 A conf
Learning Tree Pattern Transformations.
ICDT
Daniel Neider, Leif Sabellek, Johannes Schmidt, Fabian Vehlken, Thomas Zeume
2024 J jnl
Learning Tree Pattern Transformations.
CoRR
Daniel Neider, Leif Sabellek, Johannes Schmidt, Fabian Vehlken, Thomas Zeume
2024 A* conf
Quantitative Claim-Centric Reasoning in Logic-Based Argumentation.
IJCAI
Markus Hecher, Yasir Mahmood, Arne Meier, Johannes Schmidt
2023 A* conf
Complexity of Reasoning with Cardinality Minimality Conditions.
AAAI
Nadia Creignou, Frédéric Olive, Johannes Schmidt
2023 J jnl
Complexity of Reasoning with Cardinality Minimality Conditions.
CoRR
Nadia Creignou, Frédéric Olive, Johannes Schmidt
2023 J jnl
Parameterized Complexity of Logic-based Argumentation in Schaefer's Framework.
ACM Trans. Comput. Log.
Yasir Mahmood, Arne Meier, Johannes Schmidt
2021 A* conf
Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework.
AAAI
Yasir Mahmood, Arne Meier, Johannes Schmidt
2021 J jnl
Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework.
CoRR
Yasir Mahmood, Arne Meier, Johannes Schmidt
2021 J jnl
Parameterized complexity of abduction in Schaefer's framework.
J. Log. Comput.
Yasir Mahmood, Arne Meier, Johannes Schmidt
2021 J jnl
The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems.
Theor. Comput. Sci.
Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman
2020 Misc conf
Parameterised Complexity of Abduction in Schaefer's Framework.
LFCS
Yasir Mahmood, Arne Meier, Johannes Schmidt
2019 J jnl
Parameterised Complexity for Abduction.
CoRR
Yasir Mahmood, Arne Meier, Johannes Schmidt
2017 J jnl
Paradigms for Parameterized Enumeration.
Theory Comput. Syst.
Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer
2017 C conf
The Weight in Enumeration.
LATA
Johannes Schmidt
2016 J jnl
The Weight in Enumeration.
CoRR
Johannes Schmidt
2015 J jnl
On the parameterized complexity of non-monotonic logics.
Arch. Math. Log.
Arne Meier, Irina Schindler, Johannes Schmidt, Michael Thomas, Heribert Vollmer
2014 J jnl
Complexity Classifications for Logic-Based Argumentation.
ACM Trans. Comput. Log.
Nadia Creignou, Uwe Egly, Johannes Schmidt
2014 — conf
Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis.
MFCS (2)
Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman
2014 J jnl
Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis.
CoRR
Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman
2013 J jnl
Complexity Classifications for logic-based Argumentation
CoRR
Nadia Creignou, Uwe Egly, Johannes Schmidt
2013 B conf
Paradigms for Parameterized Enumeration.
MFCS
Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer
2013 J jnl
Paradigms for Parameterized Enumeration.
CoRR
Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer
2013 B conf
The Complexity of Abduction for Equality Constraint Languages.
CSL
Johannes Schmidt, Michal Wrona
2012 J jnl
Complexity Classifications for Propositional Abduction in Post's Framework.
J. Log. Comput.
Nadia Creignou, Johannes Schmidt, Michael Thomas
2012 — —
Complexity classifications for nonmonotonic reasoning and enumeration.
Johannes Schmidt
2012 C conf
Complexity of logic-based argumentation in Schaefer's framework.
COMMA
Nadia Creignou, Uwe Egly, Johannes Schmidt
2012 C conf
On the Parameterized Complexity of Default Logic and Autoepistemic Logic.
LATA
Arne Meier, Johannes Schmidt, 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 A conf
Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight.
SAT
Nadia Creignou, Frédéric Olive, Johannes Schmidt
2011 J jnl
On the Parameterized Complexity of Default Logic and Autoepistemic Logic
CoRR
Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer
2010 J jnl
Complexity Classifications for Propositional Abduction in Post's Framework
CoRR
Nadia Creignou, Johannes Schmidt, Michael Thomas
2010 A* conf
Complexity of Propositional Abduction for Restricted Sets of Boolean Functions.
KR
Nadia Creignou, Johannes Schmidt, Michael Thomas
2010 B conf
Sets of Boolean Connectives That Make Argumentation Easier.
JELIA
Nadia Creignou, Johannes Schmidt, Michael Thomas, Stefan Woltran
2009 J jnl
Complexity of Propositional Abduction for Restricted Sets of Boolean Functions
CoRR
Nadia Creignou, Johannes Schmidt, Michael Thomas