default search action
Johannes Schmidt 0001
Person information
- affiliation: Jönköping University, Sweden
- affiliation (former): Linköping University, Sweden
- affiliation (former): Aix-Marseille Université, France
Other persons with the same name
- Johannes Schmidt — disambiguation page
- Johannes Schmidt 0002 — Monash University
- Johannes Schmidt 0003
— University of Leipzig, Department of Computer Science, Germany
- Johannes Schmidt 0004 — Sixgroups INSTANT Communities GmbH, Hamburg
- Johannes Schmidt 0005
- Johannes Schmidt 0006
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c13]Markus Hecher, Yasir Mahmood, Arne Meier, Johannes Schmidt:
Quantitative Claim-Centric Reasoning in Logic-Based Argumentation. IJCAI 2024: 3404-3412 - 2023
- [j8]Yasir Mahmood
Parameterized Complexity of Logic-based Argumentation in Schaefer's Framework. ACM Trans. Comput. Log. 24(3): 26:1-26:25 (2023) - [c12]Nadia Creignou, Frédéric Olive, Johannes Schmidt:
Complexity of Reasoning with Cardinality Minimality Conditions. AAAI 2023: 3932-3940 - [i10]Nadia Creignou, Frédéric Olive, Johannes Schmidt:
Complexity of Reasoning with Cardinality Minimality Conditions. CoRR abs/2303.01571 (2023) - 2021
- [j7]Yasir Mahmood
Parameterized complexity of abduction in Schaefer's framework. J. Log. Comput. 31(1): 266-296 (2021) - [j6]Peter Jonsson, Victor Lagerkvist, Johannes Schmidt
The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems. Theor. Comput. Sci. 892: 1-24 (2021) - [c11]Yasir Mahmood, Arne Meier, Johannes Schmidt:
Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework. AAAI 2021: 6426-6434 - [i9]Yasir Mahmood, Arne Meier, Johannes Schmidt:
Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework. CoRR abs/2102.11782 (2021) - 2020
- [c10]Yasir Mahmood
Parameterised Complexity of Abduction in Schaefer's Framework. LFCS 2020: 195-213
2010 – 2019
- 2019
- [i8]Yasir Mahmood, Arne Meier, Johannes Schmidt:
Parameterised Complexity for Abduction. CoRR abs/1906.00703 (2019) - 2017
- [j5]Nadia Creignou, Arne Meier
Paradigms for Parameterized Enumeration. Theory Comput. Syst. 60(4): 737-758 (2017) - [c9]Johannes Schmidt:
The Weight in Enumeration. LATA 2017: 208-219 - 2016
- [i7]Johannes Schmidt:
The Weight in Enumeration. CoRR abs/1612.00675 (2016) - 2015
- [j4]Arne Meier
On the parameterized complexity of non-monotonic logics. Arch. Math. Log. 54(5-6): 685-710 (2015) - 2014
- [j3]Nadia Creignou, Uwe Egly, Johannes Schmidt:
Complexity Classifications for Logic-Based Argumentation. ACM Trans. Comput. Log. 15(3): 19:1-19:20 (2014) - [c8]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: 408-419 - [i6]Peter Jonsson, Victor Lagerkvist, Johannes Schmidt, Hannes Uppman:
Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis. CoRR abs/1406.3247 (2014) - 2013
- [c7]Johannes Schmidt, Michal Wrona:
The Complexity of Abduction for Equality Constraint Languages. CSL 2013: 615-633 - [c6]Nadia Creignou, Arne Meier
Paradigms for Parameterized Enumeration. MFCS 2013: 290-301 - [i5]Nadia Creignou, Uwe Egly, Johannes Schmidt:
Complexity Classifications for logic-based Argumentation. CoRR abs/1304.5388 (2013) - [i4]Nadia Creignou, Arne Meier, Julian-Steffen Müller, Johannes Schmidt, Heribert Vollmer:
Paradigms for Parameterized Enumeration. CoRR abs/1306.2171 (2013) - 2012
- [b1]Johannes Schmidt:
Complexity classifications for nonmonotonic reasoning and enumeration. University of Hanover, 2012 - [j2]Nadia Creignou, Johannes Schmidt, Michael Thomas:
Complexity Classifications for Propositional Abduction in Post's Framework. J. Log. Comput. 22(5): 1145-1170 (2012) - [c5]Nadia Creignou, Uwe Egly, Johannes Schmidt:
Complexity of logic-based argumentation in Schaefer's framework. COMMA 2012: 237-248 - [c4]Arne Meier
On the Parameterized Complexity of Default Logic and Autoepistemic Logic. LATA 2012: 389-400 - 2011
- [j1]Nadia Creignou, Johannes Schmidt, Michael Thomas, Stefan Woltran:
Complexity of logic-based argumentation in Post's framework. Argument Comput. 2(2-3): 107-129 (2011) - [c3]Nadia Creignou, Frédéric Olive, Johannes Schmidt:
Enumerating All Solutions of a Boolean CSP by Non-decreasing Weight. SAT 2011: 120-133 - [i3]Arne Meier, Johannes Schmidt, Michael Thomas, Heribert Vollmer:
On the Parameterized Complexity of Default Logic and Autoepistemic Logic. CoRR abs/1110.0623 (2011) - 2010
- [c2]Nadia Creignou, Johannes Schmidt, Michael Thomas, Stefan Woltran:
Sets of Boolean Connectives That Make Argumentation Easier. JELIA 2010: 117-129 - [c1]Nadia Creignou, Johannes Schmidt, Michael Thomas:
Complexity of Propositional Abduction for Restricted Sets of Boolean Functions. KR 2010 - [i2]Nadia Creignou, Johannes Schmidt, Michael Thomas:
Complexity Classifications for Propositional Abduction in Post's Framework. CoRR abs/1006.4923 (2010)
2000 – 2009
- 2009
- [i1]Nadia Creignou, Johannes Schmidt, Michael Thomas:
Complexity of Propositional Abduction for Restricted Sets of Boolean Functions. CoRR abs/0912.3134 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-19 21:44 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: