Bucket Elimination: A Unifying Framework for Reasoning

@article{Dechter1999BucketEA,
  title={Bucket Elimination: A Unifying Framework for Reasoning},
  author={R. Dechter},
  journal={Artif. Intell.},
  year={1999},
  volume={113},
  pages={41-85}
}
  • R. Dechter
  • Published 1999
  • Computer Science
  • Artif. Intell.
  • 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… CONTINUE READING
    644 Citations
    M best solutions over Graphical Models
    • 6
    • PDF
    Solving #SAT and Bayesian Inference with Backtracking Search
    • 77
    • Highly Influenced
    • PDF
    Value Elimination: Bayesian Interence via Backtracking Search
    • 73
    • Highly Influenced
    • PDF
    Tractable Structures for Constraint Satisfaction Problems
    • R. Dechter
    • Mathematics, Computer Science
    • Handbook of Constraint Programming
    • 2006
    • 37
    • PDF
    Boosting Search with Variable Elimination in Constraint Optimization and Constraint Satisfaction Problems
    • 58
    • PDF
    Aggregation and constraint processing in lifted probabilistic inference
    • 5
    • Highly Influenced
    • PDF

    References

    SHOWING 1-10 OF 75 REFERENCES
    Bucket elimination: A unifying framework for probabilistic inference
    • 533
    • PDF
    Network-Based Heuristics for Constraint-Satisfaction Problems
    • 515
    To Guess or to Think? Hybrid Algorithms for SAT (Extended Abstract)
    • 13
    • PDF
    Dynamic Variable Ordering in CSPs
    • 121
    • PDF
    A Sufficient Condition for Backtrack-Free Search
    • 809
    • PDF
    Computers and Intractability: A Guide to the Theory of NP-Completeness
    • 47,327
    • PDF
    Hybrid algorithms for approximate belief updating in Bayes nets
    • 28
    Probabilistic Partial Evaluation: Exploiting Rule Structure in Probabilistic Inference
    • D. Poole
    • Mathematics, Computer Science
    • IJCAI
    • 1997
    • 59
    • PDF