Unifying tree decompositions for reasoning in graphical models

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 cliquetree 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 treedecomposition processing are analyzed. 2005 Published by Elsevier B.V.

• Type: Journal
• Year: 2005
• Where: AI
• Authors: Kalev Kask, Rina Dechter, Javier Larrosa, Avi Dechter
• Keywords: AI 2005, Algorithm, Artificial Intelligence, Unifying Perspective, Various Automated Reasoning