Regular resolution for CNF of bounded incidence treewidth with few long clauses.
arXiv: Computational Complexity(2019)
摘要
We demonstrate that Regular Resolution is FPT for two restricted families of CNFs of bounded incidence treewidth. The first includes CNFs having at most $p$ clauses whose removal results in a CNF of primal treewidth at most $k$. The parameters we use in this case are $p$ and $k$. The second class includes CNFs of bounded one-sided (incidence) treewdth, a new parameter generalizing both primal treewidth and incidence pathwidth. The parameter we use in this case is the one-sided treewidth.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要