超图的无环性与命题模型计数
Hypergraph Acyclicity and Propositional Model Counting
摘要:
我们发现,命题模型计数问题#SAT的CNF-公式与超图,允许一个不相交的分支分解,可以解决在多项式时间。我们发现,这类超图是无法比拟的超图的有界关联度的宽度是最大的一类超图,其中#SAT是已知的多项式时间可解到目前为止。此外,我们提出了一个多项式时间算法,计算一个给定的超图的不相交分支分解,如果它存在,否则拒绝。最后,我们表明,一些轻微的扩张类的超图与不相交的分支分解导致棘手的#SAT,留下开放如何推广本文的计数结果。
英文摘要:
We show that the propositional model counting problem #SAT for CNF- formulas with hypergraphs that allow a disjoint branches decomposition can be solved in polynomial time. We show that this class of hypergraphs is incomparable to hypergraphs of bounded incidence cliquewidth which were the biggest class of hypergraphs for which #SAT was known to be solvable in polynomial time so far. Furthermore, we present a polynomial time algorithm that computes a disjoint branches decomposition of a given hypergraph if it exists and rejects otherwise. Finally, we show that some slight extensions of the class of hypergraphs with disjoint branches decompositions lead to intractable #SAT, leaving open how to generalize the counting result of this paper.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。