Parameterised Complexity of Propositional Inclusion and Independence Logic
Logic in Computer Science
2023-07-14 v3 Computational Complexity
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.
Cite
@article{arxiv.2105.14887,
title = {Parameterised Complexity of Propositional Inclusion and Independence Logic},
author = {Yasir Mahmood and Jonni Virtema},
journal= {arXiv preprint arXiv:2105.14887},
year = {2023}
}
Comments
A revised version