Bucket-Tree Elimination for Automated Reasoning

Bucket-Tree Elimination for Automated Reasoning
复制标题

用于自动推理的桶树消除

DOI：
--
复制
发表时间：
2001
期刊：
影响因子：
--
通讯作者：
Fabio Gagliardi Cozman
Fabio Gagliardi Cozman
中科院分区：
--
文献类型：
--
作者：
Kalev Kask;R. Dechter;J. Larrosa;Fabio Gagliardi Cozman

文献摘要

被引文献

相似文献

本文将几种变量消除方案推广为一种两阶段的桶树消息传递算法，即沿着传递。我们的分析表明，新的算法，称为桶树消除（BTE），可以提供一个显着的速度超过标准的变量消除重要的概率推理任务。该算法的开发和分析在一个统一的视图树聚类方法，使清晰的两种方法之间的关系，并允许增强计划转移。特别是，我们展示了如何时空tradeos的BTE的treedcomposition框架内铸造。
The paper extends several variable elimination schemes into a two-phase message passing algorithm along a bucket-tree. Our analysis shows that the new algorithm, called Bucket-Tree Elimination (BTE), may provide a substantial speed-up over standard variable-elimination for important probabilistic reasoning tasks. The algorithm is developed and analyzed within a unifying view of tree-clustering methods, making crisp the relationship between the two approaches, and allowing enhancement schemes to be transferred. In particular we show how time-space tradeo s of BTE are cast within the treedecomposition framework.