4 papers
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.…