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 31 papers between 2019 and 2026.

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

2026
Diversity of Extensions in Abstract Argumentation.
CoRR, May, 2026

Inconsistent Databases and Argumentation Frameworks with Collective Attacks.
CoRR, May, 2026

Rethinking Explanations: Formalizing Contrast in Description Logics.
CoRR, May, 2026

ABox Abduction for Inconsistent Knowledge Bases under Repair Semantics.
CoRR, May, 2026

Document-Level Relation Extraction Using Reinforcement Learning with Knowledge Graph Feedback.
Proceedings of the Semantic Web - 23rd European Semantic Web Conference, 2026

Structure-Aware Encodings of Argumentation Properties for Clique-width.
Proceedings of the Fortieth AAAI Conference on Artificial Intelligence, 2026

Can You Tell the Difference? Contrastive Explanations for ABox Entailments.
Proceedings of the Fortieth AAAI Conference on Artificial Intelligence, 2026

2025
Tree-Based OWL Class Expression Learner over Large Graphs.
Proceedings of the Machine Learning and Knowledge Discovery in Databases. Research Track, 2025

Neural Reasoning for Robust Instance Retrieval in SHOIQ.
Proceedings of the 13th Knowledge Capture Conference 2025, 2025

Facets in Argumentation: A Formal Approach to Argument Significance.
Proceedings of the Thirty-Fourth International Joint Conference on Artificial Intelligence, 2025

Why not? Developing ABox Abduction Beyond Repairs.
Proceedings of the 38th International Workshop on Description Logics, 2025

Dung's Argumentation Framework: Unveiling the Expressive Power with Inconsistent Databases.
Proceedings of the Thirty-Ninth AAAI Conference on Artificial Intelligence, 2025

2024
Parameterized complexity of weighted team definability.
Math. Struct. Comput. Sci., 2024

Parameterised Complexity of Consistent Query Answering via Graph Representations.
CoRR, 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 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

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

Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework.
Proceedings of the Thirty-Fifth AAAI 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

Parameterised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic.
Proceedings of the Foundations of Information and Knowledge Systems, 2020

2019
Parameterised Complexity for Abduction.
CoRR, 2019

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


  Loading...