Johannes Schmidt

Mahmood, Y., Meier, A., Schmidt, J. (2023). Parameterized Complexity of Logic-based Argumentation in Schaefer's Framework ACM Transactions on Computational Logic, 24(3). More information

Jonsson, P., Lagerkvist, V., Schmidt, J., Uppman, H. (2021). The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems Theoretical Computer Science, 892, 1-24. More information

Mahmood, Y., Meier, A., Schmidt, J. (2021). Parameterized complexity of abduction in Schaefer's framework Journal of logic and computation (Print), 31(1), 266-296. More information

Creignou, N., Meier, A., Müller, J., Schmidt, J., Vollmer, H. (2017). Paradigms for Parameterized Enumeration Theory of Computing Systems, 60(4), 737-758. More information

Meier, A., Schindler, I., Schmidt, J., Thomas, M., Vollmer, H. (2015). On the parameterized complexity of non-monotonic logics Archive for mathematical logic, 54(5-6), 685-710. More information

Creignou, N., Egly, U., Schmidt, J. (2014). Complexity Classifications for Logic-Based Argumentation ACM Transactions on Computational Logic, 15(3). More information

Creignou, N., Schmidt, J., Thomas, M. (2012). Complexity classifications for propositional abduction in Post's framework Journal of logic and computation (Print), 22(5), 1145-1170. More information

Creignou, N., Schmidt, J., Thomas, M., Woltran, S. (2011). Complexity of logic-based argumentation in Post's framework Argument and Computation, 2(2-3), 107-129. More information

Creignou, N., Olive, F., Schmidt, J. (2023). Complexity of Reasoning with Cardinality Minimality Conditions. Proceedings of the 37th AAAI Conference on Artificial Intelligence, AAAI 2023, February 7–14, 2023, Washington DC, USA. More information

Mahmood, Y., Meier, A., Schmidt, J. (2021). Parameterized Complexity of Logic-Based Argumentation in Schaefer’s Framework. Thirty-Fifth AAAI Conference on Artificial Intelligence, AAAI 2021, Virtual Event, February 2-9, 2021. More information

Mahmood, Y., Meier, A., Schmidt, J. (2020). Parameterised Complexity of Abduction in Schaefer’s Framework. Cham: Springer, International Symposium, LFCS 2020 Deerfield Beach, FL, USA, January 4–7, 2020. More information

Schmidt, J. (2017). The Weight in Enumeration. LATA 2017, 11th International Conference on Language and Automata Theory and Applications, Umeå, 6-9 March, 2017.. More information

Jonsson, P., Lagerkvist, V., Schmidt, J., Uppman, H. (2014). Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis. 39th International Symposium on Mathematical Foundations of Computer Science (MFCS-2014). More information

Creignou, N., Meier, A., Müller, J., Schmidt, J., Vollmer, H. (2013). Paradigms for Parameterized Enumeration. 38th International Symposium on Mathematical Foundations of Computer Science (MFCS-2013), Klosterneuburg, Austria, August 26-30, 2013. More information

Schmidt, J., Wrona, M. (2013). The Complexity of Abduction for Equality Constraint Languages. 22nd EACSL Annual Conference on Computer Science Logic (CSL-2013) September 2-5, 2013, Torino, Italy. More information

Creignou, N., Egly, U., Schmidt, J. (2012). Complexité de l'argumentation dans le cadre de Schaefer. Journées Nationales de l’Intelligence Artificielle Fondamentale (JIAF’12), 2012. More information

Meier, A., Schmidt, J., Thomas, M., Vollmer, H. (2012). On the parameterized complexity of default logic and autoepistemic logic. Berlin: Springer, 6th International Conference on Language and Automata Theory and Applications, LATA 2012; A Coruna; Spain; 5 March 2012 through 9 March 2012; Code 88895. More information

Creignou, N., Schmidt, J. (2012). Complexity of logic-based argumentation in Schaefer's framework. 4th Conference on Computational Models of Argument (COMMA), Vienna, Austria, September 10-12, 2012. More information

Creignou, N., Olive, F., Schmidt, J. (2011). Enumérer tous les modèles de formules booléennes par poids croissant. Journées Francophones de Programmation par Contraintes (JFPC’11), du 8 au 10 juin 2011. More information

Creignou, N., Olive, F., Schmidt, J. (2011). Enumerating all solutions of a Boolean CSP by non-decreasing weight. Berlin: Springer, 14th International Conference on Theory and Applications of Satisfiability Testing, SAT 2011; Ann Arbor, MI; United States; 19 June 2011 through 22 June 2011; Code 85244. More information

Creignou, N., Schmidt, J., Thomas, M., Woltran, S. (2010). Complexité de l’argumentation dans le cadredu treillis de Post. Journées Nationales de l’Intelligence Artificielle Fondamentale(JIAF’10), 2010. More information

Creignou, N., Schmidt, J., Thomas, M., Woltran, S. (2010). Sets of Boolean connectives that make argumentation easier. Berlin: Springer, 12th European Conference, JELIA 2010, Helsinki, Finland, September 13-15, 2010. More information

Creignou, N., Schmidt, J., Thomas, M. (2010). Complexity of propositional abduction for restricted sets of Boolean functions. The Twelfth International Conference on the Principles of Knowledge Representation and Reasoning, May 9 – 13, 2010, Toronto, Canada. More information