The parameterized complexity of abduction

Abduction belongs to the most fundamental reasoning methods. It is a method for reverse inference, this means one is interested in explaining observed behavior by finding appropriate causes. We study logic-based ab-duction, where knowledge is represented by proposi-tional formulas. The computational complexity of this problem is highly intractable in many interesting set-tings. In this work we therefore present an extensive parameterized complexity analysis of abduction within various fragments of propositional logic together with (combinations of) natural parameters