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.

翻译：本文全面研究了命题包含逻辑与独立逻辑的模型检测和可满足性问题的参数化复杂度。我们发现对于大多数参数化方案，这些问题要么属于固定参数可处理类，要么是参数化NP完全问题。