arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1401.3458cs.AI
收藏

用回溯搜索求解# SAT和贝叶斯推理

Solving #SAT and Bayesian Inference with Backtracking Search

University of Toronto(多伦多大学)

Fahiem Bacchus, Shannon Dalmao, Toniann Pitassi

摘要:

贝叶斯网中的推理是概率推理中的一个重要问题,有着广泛的应用。计算一个命题公式(#SAT)的满足赋值的个数是一个密切相关的基本理论问题。这两个问题,以及其他问题,都是一类产品和(SUMPROD)问题的成员。在本文中,我们表明,标准的回溯搜索时,增加了一个简单的memoization计划(缓存)可以解决任何产品的总和问题的时间复杂度,至少是好的任何其他国家的最先进的精确算法,它也可以实现最好的时间-空间权衡。此外,回溯的能力,利用更灵活的变量排序,使我们能够证明,它可以实现指数加速比其他标准算法的SUMPROD在某些情况下。这里提出的想法已被用于已被应用于各种类型的产品的总和问题的求解器。这些系统利用了这样一个事实,即回溯可以自然地利用更多的问题结构来提高一系列问题实例的性能。这种性能增益的经验证据已经出现在描述这些求解器的出版作品中,我们为这些作品提供了参考。

英文摘要:

Inference in Bayes Nets (BAYES) is an important problem with numerous applications in probabilistic reasoning. Counting the number of satisfying assignments of a propositional formula (#SAT) is a closely related problem of fundamental theoretical importance. Both these problems, and others, are members of the class of sum-of-products (SUMPROD) problems. In this paper we show that standard backtracking search when augmented with a simple memoization scheme (caching) can solve any sum-of-products problem with time complexity that is at least as good any other state-of-the-art exact algorithm, and that it can also achieve the best known time-space tradeoff. Furthermore, backtracking's ability to utilize more flexible variable orderings allows us to prove that it can achieve an exponential speedup over other standard algorithms for SUMPROD on some instances. The ideas presented here have been utilized in a number of solvers that have been applied to various types of sum-of-product problems. These system's have exploited the fact that backtracking can naturally exploit more of the problem's structure to achieve improved performance on a range of probleminstances. Empirical evidence of this performance gain has appeared in published works describing these solvers, and we provide references to these works.

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

↑