activity
20192026
most citedParametrised Complexity of Model Checking and Satisfiability in Propositional Dependence Logic

1 citations · 1 across the 9 of their papers we have counts for

collaborators
Showing cs.AIShow all

5 papers · 1 filter

cs.AI2026

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…

cs.AI2025

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…

cs.AI2025

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…

cs.AI2024

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…

cs.AI2021

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…