2000 character limit reached
Parameterised Complexity of Propositional Inclusion and Independence Logic (2105.14887v3)
Published 31 May 2021 in cs.LO and cs.CC
Abstract: 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.