Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
9650014 | Artificial Intelligence | 2005 | 29 Pages |
Abstract
The paper provides a unifying perspective of tree-decomposition algorithms appearing in various automated reasoning areas such as join-tree clustering for constraint-satisfaction and the clique-tree algorithm for probabilistic reasoning. Within this framework, we introduce a new algorithm, called bucket-tree elimination (BTE), that extends Bucket Elimination (BE) to trees, and show that it can provide a speed-up of n over BE for various reasoning tasks. Time-space tradeoffs of tree-decomposition processing are analyzed.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Artificial Intelligence
Authors
Kalev Kask, Rina Dechter, Javier Larrosa, Avi Dechter,