Mini-buckets: A general scheme for generating approximations in automated reasoning

IJCAI International Joint Conference on Artificial Intelligence

Volumn 2, Issue , 1997, Pages 1297-1302

  Dechter, Rina ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED REASONING; BUCKET ELIMINATIONS; PROBABILISTIC INFERENCE; REASONING TASKS;

ALGORITHMS; ARTIFICIAL INTELLIGENCE;

INFERENCE ENGINES;

EID: 84880665054     PISSN: 10450823     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (15)

1. S. A. Arnborg. Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey. BIT, 25:2-23, 1985.
2. U. Bertele and F. Brioschi. In Nonserial Dynamic Programming. Academic Press, 1972.
3. C. Canning, E.A. Thompson, and M.H. Probability functions on complex pedigrees. Advances in Applied Probability, 10:26-61, 1978.
4. M. Davis and H. Putnam. A computing procedure for quantification theory. Journal of the Association of Computing Machinery, 7(3), 1960.
5. R. Dechter and J. Pearl. Network-based heuristics for constraint satisfaction problems. Artificial Intelligence, 34:1-38, 1987.
6. R. Dechter and I. Rish. Directional resolution: The davis-putnam procedure, revisited. In Proceedings of Knowledge Representation (KR-94), pages 134-145, Bonn, Germany, 1994.
7. R. Dechter and P. van Beek. Local and global relational consistency. Theoretical Computer Science, (A preliminary version appears in CP-95 International Conference on Principles and Practice of Constraint Programming, pp. £40-257, 1995), 1997.
8. R. Dechter. Bucket elimination: A unifying framework for probabilistic inference algorithms. In Uncertainty in AI (UAI-96), pages 211-219, 1996.
9. T. S. Jaakkola and M. I. Jordan. Recursive algorithms for approximating probabilities in graphical models. Advances in Neural Information Processing Systems, 9, 1996.
10. J.-L. Lassez and M. Mahler. On fourier's algorithm for linear constraints. Journal of Automated Reasoning, 9, 1992.
11. J. Pearl. Heuristics: Intelligent search strategies. In Addison- Wesley, 1984.
12. N. Robertson and P. Seymour. Graph minor, xiii. the disjoint paths problem. Combinatorial Theory, Series B, 63:65-110, 1995.
13. P.P. Shenoy. Valuation-based systems for bayesian decision analysis. Operations Research, 40:463-484, 1992.
14. J.A. Tatman and R.D. Shachter. Dynamic programming and influence diagrams. IEEE Transactions on Systems, Man, and Cybernetics, 1990.
15. N. L. Zhang and D. Poole. Exploiting causal independence in bayesian network inference. Journal of Artificial Intelligence Research, (JAIR), 1996.