arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1506.02639cs.AI
收藏

知识编译的新极限及其在精确模型计数中的应用

New Limits for Knowledge Compilation and Applications to Exact Model Counting

University of Washington(华盛顿大学)

Paul Beame, Vincent Liew

摘要:

我们展示了新的限制使用现有技术的效率,使大类的自然问题的精确概率推理。特别是,我们展示了新的知识编译SDD和DNNF形式的下限。我们给出了强有力的下限SDD表示的复杂性SDD的大小,最佳分区通信复杂性。我们使用这种关系来证明指数下界的SDD的大小代表了一个大类的问题,自然发生的概率数据库查询。结果是,对于表示联合查询的联合,SDD在质量上并不比OBDD更简洁。我们还推导出简单的例子,SDDs必须是指数比FBDD简洁。最后,我们推导出指数下界的DNNF表示使用一个新的拟多项式模拟DNNF的非确定性FBDD的大小。

英文摘要:

We show new limits on the efficiency of using current techniques to make exact probabilistic inference for large classes of natural problems. In particular we show new lower bounds on knowledge compilation to SDD and DNNF forms. We give strong lower bounds on the complexity of SDD representations by relating SDD size to best-partition communication complexity. We use this relationship to prove exponential lower bounds on the SDD size for representing a large class of problems that occur naturally as queries over probabilistic databases. A consequence is that for representing unions of conjunctive queries, SDDs are not qualitatively more concise than OBDDs. We also derive simple examples for which SDDs must be exponentially less concise than FBDDs. Finally, we derive exponential lower bounds on the sizes of DNNF representations using a new quasipolynomial simulation of DNNFs by nondeterministic FBDDs.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑