1 citations · 1 across the 9 of their papers we have counts for
12 papers
The More the Merrier: Combining Properties for ABox Abduction under Repair Semantics in ELbot
Anselm Haak, Patrick Koopmann, Yasir Mahmood +1
Abduction is a central approach to explain missing entailments from a knowledge base by providing a hypothesis, that would, if added to the knowledge base, make the missing entailm…
Diversity of Extensions in Abstract Argumentation
Johannes K. Fichte, Markus Hecher, Yasir Mahmood +1
Argumentation is an important topic of AI for modelling and reasoning about arguments. In abstract argumentation, we consider directed graphs, so-called argumentation frameworks (A…
Structure-Aware Encodings of Argumentation Properties for Clique-width
Yasir Mahmood, Markus Hecher, Johanna Groven +1
Structural measures of graphs, such as treewidth, are central tools in computational complexity resulting in efficient algorithms when exploiting the parameter. It is even known th…
Facets in Argumentation: A Formal Approach to Argument Significance
Johannes Fichte, Nicolas Fröhlich, Markus Hecher +4
Argumentation is a central subarea of Artificial Intelligence (AI) for modeling and reasoning about arguments. The semantics of abstract argumentation frameworks (AFs) is given by…
Parameterised Complexity of Consistent Query Answering via Graph Representations
Teemu Hankala, Miika Hannula, Yasir Mahmood +1
We study consistent query answering via different graph representations. First, we introduce solution-conflict hypergraphs in which nodes represent facts and edges represent either…
Rejection in Abstract Argumentation: Harder Than Acceptance?
Johannes K. Fichte, Markus Hecher, Yasir Mahmood +1
Abstract argumentation is a popular toolkit for modeling, evaluating, and comparing arguments. Relationships between arguments are specified in argumentation frameworks (AFs), and…
Logics with probabilistic team semantics and the Boolean negation
Miika Hannula, Minna Hirvonen, Juha Kontinen +3
We study the expressivity and the complexity of various logics in probabilistic team semantics with the Boolean negation. In particular, we study the extension of probabilistic ind…
Parameterized Complexity of Weighted Team Definability
Juha Kontinen, Yasir Mahmood, Arne Meier +1
In this article, we study the complexity of weighted team definability for logics with team semantics. This problem is a natural analogue of one of the most studied problems in par…
A Parameterized View on the Complexity of Dependence Logic
Juha Kontinen, Arne Meier, Yasir Mahmood
In this paper, we investigate the parameterized complexity of model checking for Dependence Logic which is a well studied logic in the area of Team Semantics. We start with a list…
Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework
Yasir Mahmood, Arne Meier, Johannes Schmidt
Logic-based argumentation is a well-established formalism modelling nonmonotonic reasoning. It has been playing a major role in AI for decades, now. Informally, a set of formulas i…
Parameterised Complexity of Abduction in Schaefer's Framework
Yasir Mahmood, Arne Meier, Johannes Schmidt
Abductive reasoning is a non-monotonic formalism stemming from the work of Peirce. It describes the process of deriving the most plausible explanations of known facts. Considering…
Parametrised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic
Yasir Mahmood, Arne Meier
In this paper, we initiate a systematic study of the parametrised complexity in the field of Dependence Logics which finds its origin in the Dependence Logic of Väänänen from 2007.…