Yasir Mahmood

Orcid: 0000-0002-5651-5391

Affiliations:
  • Paderborn University, Germany
  • Leibniz Universität Hannover, Germany (former)


According to our database1, Yasir Mahmood authored at least 18 papers between 2019 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Quantitative Claim-Centric Reasoning in Logic-Based Argumentation.
Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence, 2024

Computing Repairs Under Functional and Inclusion Dependencies via Argumentation.
Proceedings of the Foundations of Information and Knowledge Systems, 2024

Rejection in Abstract Argumentation: Harder Than Acceptance?
Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

2023
Parameterized Complexity of Logic-based Argumentation in Schaefer's Framework.
ACM Trans. Comput. Log., 2023

Parameterized Complexity of Weighted Team Definability.
CoRR, 2023

Parameterized Complexity of Propositional Inclusion and Independence Logic.
Proceedings of the Logic, Language, Information, and Computation, 2023

Logics with Probabilistic Team Semantics and the Boolean Negation.
Proceedings of the Logics in Artificial Intelligence - 18th European Conference, 2023

Quantitative Reasoning and Structural Complexity for Claim-Centric Argumentation.
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023

2022
Parameterized aspects of team-based formalisms and logical inference
PhD thesis, 2022

A parameterized view on the complexity of dependence and independence logic.
J. Log. Comput., 2022

Parameterised complexity of model checking and satisfiability in propositional dependence logic.
Ann. Math. Artif. Intell., 2022

A Parameterized View on the Complexity of Dependence Logic.
Proceedings of the Logical Foundations of Computer Science - International Symposium, 2022

2021
Parameterized complexity of abduction in Schaefer's framework.
J. Log. Comput., 2021

Parameterised Complexity of Propositional Logic in Team Semantics.
CoRR, 2021

Decomposition-Guided Reductions for Argumentation and Treewidth.
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

2020
Parameterised Complexity of Abduction in Schaefer's Framework.
Proceedings of the Logical Foundations of Computer Science - International Symposium, 2020

2019
Parameterised Complexity for Abduction.
CoRR, 2019

Parametrised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic.
CoRR, 2019


  Loading...