Unifying Cluster-Tree Decompositions for Automated Reasoning

The paper provides a unifying perspective of tree-decomposition algorithms appearing in various automated reasoning areas such as jointree clustering for constraint-satisfaction and the clique-tree algorithm for probabilistic reasoning. By following the framework introduced by Shenoy [16], we then introduce a new algorithm, called buckettree elimination (BTE), that extends Bucket Elimination (BE) [5] to trees, and show that it is also an instance of tree-decomposition. Moreover, our analysis shows that the new extension, BTE, can provide a speed-up of n over BE for important reasoning tasks. Finally, time-space tradeoffs are shown to be cast naturally within the treedecomposition framework.

[1]  Umberto Bertelè,et al.  Nonserial Dynamic Programming , 1972 .

[2]  David Maier,et al.  The Theory of Relational Databases , 1983 .

[3]  David J. Spiegelhalter,et al.  Local computations with probabilities on graphical structures and their application to expert systems , 1990 .

[4]  Prakash P. Shenoy,et al.  Axioms for probability and belief-function proagation , 1990, UAI.

[5]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems , 1988 .

[6]  Rina Dechter,et al.  Tree Clustering for Constraint Networks , 1989, Artif. Intell..

[7]  Steffen L. Lauritzen,et al.  Bayesian updating in causal probabilistic networks by local computations , 1990 .

[8]  Prakash P. Shenoy,et al.  Valuation-Based Systems for Bayesian Decision Analysis , 1992, Oper. Res..

[9]  Prakash P. Shenoy,et al.  Binary Join Trees , 1996, UAI.

[10]  Prakash P. Shenoy,et al.  Binary join trees for computing marginals in the Shenoy-Shafer architecture , 1997, Int. J. Approx. Reason..

[11]  Francesca Rossi,et al.  Semiring-based constraint satisfaction and optimization , 1997, JACM.

[12]  Rina Dechter,et al.  Bucket Elimination: A Unifying Framework for Reasoning , 1999, Artif. Intell..

[13]  Georg Gottlob,et al.  A Comparison of Structural CSP Decomposition Methods , 1999, IJCAI.

[14]  F. Cozman,et al.  Generalizing variable elimination in Bayesian networks , 2000 .

[15]  Rina Dechter,et al.  A general scheme for automatic generation of search heuristics from specification dependencies , 2001, Artif. Intell..

[16]  Javier Larrosa,et al.  A General Scheme for Multiple Lower Bound Computation in Constraint Optimization , 2001, CP.

[17]  Rina Dechter,et al.  Topological parameters for time-space tradeoff , 1996, Artif. Intell..