布尔表达式的最优上下界
Optimal Upper and Lower Bounds for Boolean Expressions by Dissociation
University of Washington（华盛顿大学）
摘要：
本文通过将变量的多次出现视为独立的，并赋予它们新的个体概率，来开发布尔表达式概率的上界和下界。我们的技术概括和扩展了一些最近的方法，这些方法被称为节点分裂，变量重命名，变量分裂，或解离概率数据库的基本思想。我们证明了我们分配给新变量的概率在某种意义上是最好的。
英文摘要：
This paper develops upper and lower bounds for the probability of Boolean expressions by treating multiple occurrences of variables as independent and assigning them new individual probabilities. Our technique generalizes and extends the underlying idea of a number of recent approaches which are varyingly called node splitting, variable renaming, variable splitting, or dissociation for probabilistic databases. We prove that the probabilities we assign to new variables are the best possible in some sense.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
