  We give a comprehensive account on the parameterized complexity of model
checking and satisfiability of propositional inclusion and independence logic.
We discover that for most parameterizations the problems are either in FPT or
paraNP-complete.
