Abstract

Bucket elimination is an algorithmic framework that generalizes dynamic programming to accommodate many problem-solving and reasoning tasks. Algorithms such as directional-resolution for propositional satisfiability, adaptive-consistency for constraint satisfaction, Fourier and Gaussian elimination for solving linear equalities and inequalities, and dynamic programming for combinatorial optimization, can all be accommodated within the bucket elimination framework. Many probabilistic inference tasks can likewise be expressed as bucket-elimination algorithms. These include: belief updating, finding the most probable explanation, and expected utility maximization. These algorithms share the same performance guarantees; all are time and space exponential in the inducedwidth of the problem's interaction graph. While elimination strategies have extensive demands on memory, a contrasting class of algorithms called "conditioning search" require only linear space. Algorithms in this class split a problem into subproblems by instantiating a subset of variables, called a conditioning set, or a cutset. Typical examples of conditioning search algorithms are: backtracking (in constraint satisfaction), and branch and bound (for combinatorial optimization). The paper presents the bucket-elimination framework as a unifying theme across probabilistic and deterministic reasoning tasks and show how conditioning search can be augmented to systematically trade space for time.

Citations

8882	Computers and Intractability: A Guide to the Theory of NP-completeness - Garey, Johnson - 1979
5666	Probabilistic reasoning in intelligent systems - Pearl - 1988
1081	Local Computations with Probabilities on graphical structures and their applications to expert systems (with discussion - Lauritzen, Spiegelhalter
926	A computing procedure for quantification theory - Davis, Putnam - 1960
837	Temporal constraint networks - Dechter, Meiri, et al. - 1991
636	A machine program for theorem proving - Davis, Logemann, et al. - 1962
360	Network-based heuristics for constraint satisfaction problems - Dechter, Pearl - 1987
316	Gaussian influence diagrams - Shachter, Kenley - 1989
250	Enhancement schemes for constraint processing: Backjumping, learning and cutset decomposition - Dechter - 1990
240	Bayesian updating in causal probabilistic networks by local computations - Jensen, Lauritzen, et al. - 1990
240	Context-specific independence in bayesian networks - Boutilier, Friedman, et al. - 1996
238	Bucket elimination: A unifying framework for probabilistic inference - Dechter - 1998
238	A Sufficient condition for backtrack-free search - Freuder
230	Tree clustering for constraint networks - Dechter, Pearl - 1989
183	Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey - Arnborg - 1985
153	Nonserial Dynamic Programming - Bertele, Brioschi - 1972
133	Semiring-based constraint satisfaction and optimization - Bistarelli, Montanari, et al. - 1997
130	Linear time algorithms for NP-hard problems restricted to partial k-trees, Discrete Applied Math - Proskurowski, Arnborg - 1989
130	Exploiting causal independence in Bayesian network inference - Zhang, Poole - 1996
103	Probabilistic inference and influence diagram - Shachter - 1988
99	Valuation-based systems for Bayesian decision analysis - Shenoy - 1992
91	Dynamic programming and influence diagrams - Tatman, Shachter - 1990
90	Directional resolution: the Davis–Putnam procedure, revisited, in - Dechter, Rish - 1994
89	Identifying independence in Bayesian networks - Geiger, Verma, et al. - 1990
62	A sufficiently fast algorithm for finding close to optimal clique trees - Becker, Geiger
56	Symbolic probabilistic inference in belief networks - Shachter, D’Ambrosio, et al. - 1990
55	Local and global relational consistency - Dechter, Beek - 1997
53	Dynamic Variable Ordering in CSPs - Bacchus, Run - 1995
53	A su cient condition for backtrack-free search - Freuder - 1982
49	Fattah. Topological Parameters for Time-Space Tradeoff - Dechter, El
46	A practical algorithm for finding optimal triangulations, in: AAAI’97: Proceedings of the 14th national conference on Artificial intelligence - Shoikhet, Geiger - 1997
40	Probability functions on complex pedigrees - Cannings, Thompson, et al. - 1978
39	A Computing Procedure for Quanti cation Theory - Davis, Putnam - 1960
39	Mini-buckets: A general scheme of generating approximation in automated reasoning - Dechter - 1997
38	On the generation of alternative explanations with implications for belief revision - Santos - 1991
36	Efficient Inference in Bayes Networks as a Combinatorial Optimization Problem - Li, D’Ambrosio - 1994
35	Charniak: A new algorithm for finding MAP assignments to belief networks - Shimony, E - 1990
34	Probabilistic partial evaluation: Exploiting structure in probabilistic inference - Poole - 1997
29	A connectionist model for diagnostic problem solving - Peng, Reggia - 1989
27	Backtracking algorithms for constraint satisfaction problems - Dechter, Frost - 1999
24	Evaluating In uence Diagrams - Shachter - 1986
20	Learning in boltzmann trees - Saul, Jordan - 1994
15	A computational scheme for reasoning in dynamic probabilistic networks - Kjærulff - 1993
13	An evaluation of structural parameters for probabilistic reasoning: results on benchmark circuits - El-Fattah, Dechter - 1996
13	Hybrid algorithms for approximate belief updating in bayes nets - Santos, Shimony, et al.
12	Contextspeci c independence in bayesian networks - Boutilier, Friedman, et al. - 1996
11	Topological parameters for time-space trade-o - Dechter - 1996
11	Plausability of diagnostic hypothesis - Peng, Reggia - 1986
10	Composition principles for synthesis of optimal multistage processes - Mitten - 1964
10	An Ordered Examination of Influence Diagrams.” Networks 20 - Shachter - 1990