Johannes Schmidt
Johannes Schmidt
Assistent Professor
Verified email at ju.se - Homepage
Title
Cited by
Cited by
Year
Paradigms for parameterized enumeration
N Creignou, A Meier, JS Müller, J Schmidt, H Vollmer
Theory of Computing Systems 60 (4), 737-758, 2017
382017
Enumerating all solutions of a Boolean CSP by non-decreasing weight
N Creignou, F Olive, J Schmidt
International Conference on Theory and Applications of Satisfiability …, 2011
252011
Enumeration: Algorithms and complexity
J Schmidt
Preprint, available at https://www. thi. uni-hannover. de/fileadmin …, 2009
212009
Complexity of propositional abduction for restricted sets of Boolean functions
N Creignou, J Schmidt, M Thomas
Twelfth International Conference on the Principles of Knowledge …, 2010
162010
Complexity of logic-based argumentation in Post's framework
N Creignou, J Schmidt, M Thomas, S Woltran
Argument & Computation 2 (2-3), 107-129, 2011
142011
Complexity classifications for propositional abduction in Post's framework
N Creignou, J Schmidt, M Thomas
Journal of Logic and Computation 22 (5), 1145-1170, 2012
112012
On the parameterized complexity of default logic and autoepistemic logic
A Meier, J Schmidt, M Thomas, H Vollmer
International Conference on Language and Automata Theory and Applications …, 2012
92012
Sets of boolean connectives that make argumentation easier
N Creignou, J Schmidt, M Thomas, S Woltran
European Workshop on Logics in Artificial Intelligence, 117-129, 2010
82010
Complexity classifications for logic-based argumentation
N Creignou, U Egly, J Schmidt
ACM Transactions on Computational Logic (TOCL) 15 (3), 1-20, 2014
62014
Theory and applications of satisfiability testing
N Creignou, F Olive, J Schmidt
SAT, 5-8, 2016
52016
On the parameterized complexity of non-monotonic logics
A Meier, I Schindler, J Schmidt, M Thomas, H Vollmer
Archive for mathematical logic 54 (5), 685-710, 2015
52015
Relating the time complexity of optimization problems in light of the exponential-time hypothesis
P Jonsson, V Lagerkvist, J Schmidt, H Uppman
International Symposium on Mathematical Foundations of Computer Science, 408-419, 2014
42014
Parameterized complexity of abduction in Schaefer’s framework
Y Mahmood, A Meier, J Schmidt
Journal of Logic and Computation 31 (1), 266-296, 2021
22021
Parameterised complexity for abduction
Y Mahmood, A Meier, J Schmidt
CoRR, abs/1906.00703, 2019
22019
The complexity of abduction for equality constraint languages
J Schmidt, M Wrona
Computer Science Logic 2013 (CSL 2013), 2013
22013
Complexity of logic-based argumentation in Schaefer's framework
N Creignou, J Schmidt, U Egly
4th Conference on Computational Models of Argument (COMMA), Vienna, Austria …, 2012
12012
Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework
Y Mahmood, A Meier, J Schmidt
arXiv preprint arXiv:2102.11782, 2021
2021
The Weight in Enumeration
J Schmidt
International Conference on Language and Automata Theory and Applications …, 2017
2017
Classification en complexité de problèmes de raisonnement non-monotone et d'énumération
J Schmidt
Aix-Marseille, 2012
2012
Complexité de l'argumentation dans le cadre de Schaefer
N Creignou, U Egly, J Schmidt
Journées Nationales de l’Intelligence Artificielle Fondamentale (JIAF’12), 2012, 2012
2012
The system can't perform the operation now. Try again later.
Articles 1–20