default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDYasir Mahmood 0002
Person information
- affiliation: Paderborn University, Germany
- affiliation (former): Leibniz Universität Hannover, Germany
Other persons with the same name
- Yasir Mahmood 0001 — Iqra University, Islamabad, Pakistan
- Yasir Mahmood 0003
![[0000-0003-1578-5229]](https://dblp.org/img/orcid-mark.12x12.png "0000-0003-1578-5229")
— Universiti Teknologi Malaysia, Kuala Lumpur, Malaysi (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier:
Rejection in Abstract Argumentation: Harder Than Acceptance? ECAI 2024: 3212-3219- [c10]Yasir Mahmood, Jonni Virtema, Timon Barlag, Axel-Cyrille Ngonga Ngomo:
Computing Repairs Under Functional and Inclusion Dependencies via Argumentation. FoIKS 2024: 23-42 - [c9]Markus Hecher, Yasir Mahmood, Arne Meier, Johannes Schmidt:
Quantitative Claim-Centric Reasoning in Logic-Based Argumentation. IJCAI 2024: 3404-3412 - [i9]Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier:
Rejection in Abstract Argumentation: Harder Than Acceptance? CoRR abs/2408.10683 (2024) - 2023
- [j4]Yasir Mahmood, Arne Meier, Johannes Schmidt:
Parameterized Complexity of Logic-based Argumentation in Schaefer's Framework. ACM Trans. Comput. Log. 24(3): 26:1-26:25 (2023) - [c8]Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier:
Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation. IJCAI 2023: 3212-3220 - [c7]Miika Hannula, Minna Hirvonen, Juha Kontinen, Yasir Mahmood, Arne Meier, Jonni Virtema:
Logics with Probabilistic Team Semantics and the Boolean Negation. JELIA 2023: 665-680 - [c6]Yasir Mahmood, Jonni Virtema:
Parameterized Complexity of Propositional Inclusion and Independence Logic. WoLLIC 2023: 274-291 - [i8]Juha Kontinen, Yasir Mahmood, Arne Meier, Heribert Vollmer:
Parameterized Complexity of Weighted Team Definability. CoRR abs/2302.00541 (2023) - [i7]Miika Hannula, Minna Hirvonen, Juha Kontinen, Yasir Mahmood, Arne Meier, Jonni Virtema:
Logics with probabilistic team semantics and the Boolean negation. CoRR abs/2306.00420 (2023) - [i6]Yasir Mahmood, Jonni Virtema, Timon Barlag, Axel-Cyrille Ngonga Ngomo:
Computing Repairs Under Functional and Inclusion Dependencies via Argumentation. CoRR abs/2312.01973 (2023) - 2022
- [b1]Yasir Mahmood:
Parameterized aspects of team-based formalisms and logical inference. University of Hanover, Germany, 2022 - [j3]Yasir Mahmood, Arne Meier:
Parameterised complexity of model checking and satisfiability in propositional dependence logic. Ann. Math. Artif. Intell. 90(2-3): 271-296 (2022) - [j2]Juha Kontinen, Arne Meier, Yasir Mahmood:
A parameterized view on the complexity of dependence and independence logic. J. Log. Comput. 32(8): 1624-1644 (2022) - [c5]Juha Kontinen, Arne Meier, Yasir Mahmood:
A Parameterized View on the Complexity of Dependence Logic. LFCS 2022: 125-142 - 2021
- [j1]Yasir Mahmood, Arne Meier, Johannes Schmidt:
Parameterized complexity of abduction in Schaefer's framework. J. Log. Comput. 31(1): 266-296 (2021) - [c4]Yasir Mahmood, Arne Meier, Johannes Schmidt:
Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework. AAAI 2021: 6426-6434 - [c3]Johannes Klaus Fichte, Markus Hecher, Yasir Mahmood, Arne Meier:
Decomposition-Guided Reductions for Argumentation and Treewidth. IJCAI 2021: 1880-1886 - [i5]Yasir Mahmood, Arne Meier, Johannes Schmidt:
Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework. CoRR abs/2102.11782 (2021) - [i4]Yasir Mahmood, Jonni Virtema:
Parameterised Complexity of Propositional Logic in Team Semantics. CoRR abs/2105.14887 (2021) - [i3]Juha Kontinen, Arne Meier, Yasir Mahmood:
A Parameterized View on the Complexity of Dependence Logic. CoRR abs/2109.09342 (2021) - 2020
- [c2]Yasir Mahmood, Arne Meier:
Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic. FoIKS 2020: 157-174 - [c1]Yasir Mahmood, Arne Meier, Johannes Schmidt:
Parameterised Complexity of Abduction in Schaefer's Framework. LFCS 2020: 195-213
2010 – 2019
- 2019
- [i2]Yasir Mahmood, Arne Meier:
Parametrised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic. CoRR abs/1904.06107 (2019) - [i1]Yasir Mahmood, Arne Meier, Johannes Schmidt:
Parameterised Complexity for Abduction. CoRR abs/1906.00703 (2019)
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-07 20:33 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:
