加载中…
2021-05-31
Parameterised Complexity of Propositional Inclusion and Independence Logic
Yasir MahmoodJonni Virtema
文献摘要
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.
讨论
0讲解博客
生成讲解博客的中文版本
AI智能校验
生成AI智能校验的中文版本