Parameterised Complexity of Propositional Inclusion and Independence Logic
Yasir Mahmood, Jonni Virtema
TL;DR
This paper analyzes the parameterized complexity of model checking and satisfiability in propositional inclusion and independence logic, revealing that most cases are either fixed-parameter tractable or paraNP-complete.
Contribution
It provides a comprehensive classification of the parameterized complexity for these logics, identifying the complexity status for various parameterizations.
Findings
Most problems are either in FPT or paraNP-complete.
The paper offers a complete complexity landscape for propositional inclusion and independence logic.
It advances understanding of the computational boundaries of these logics.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, Reasoning, and Knowledge · Advanced Algebra and Logic · semigroups and automata theory