Showing 2019Show all
3 papers · 1 filter
cs.CC2019
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…
cs.LO2019
Parameterised Counting in Logspace
Anselm Haak, Arne Meier, Om Prakash +1
In this paper, we introduce a new framework for parameterised counting in logspace, inspired by the parameterised space bounded models developed by Elberfeld, Stockhusen and Tantau…
cs.LO2019
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.…