Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning

Dechter, Rina

Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning

Download BibTeX Cite

Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence. Probabilistic Reasoning. Pages 1297-1302.

Abstract

The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework . The algorithms have adjustable levels of accuracy and efficiency, and they can be applied uniformly across many areas and problem tasks. We introduce these algorithms in the context of combinatorial optimization and probabilistic inference.

Rina Dechter. 1997. Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning. In Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, IJCAI-97. IJCAI, 1297–1302. https://ijcai.org/proceedings/1997/187

@inproceedings{ijcai1997p187,
  title     = {Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning},
  author    = {Dechter, Rina},
  booktitle = {Proceedings of the Fifteenth International Joint Conference on
               Artificial Intelligence, {IJCAI-97}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Martha E. Pollack},
  pages     = {1297--1302},
  year      = {1997},
  note      = {Probabilistic Reasoning},
  url       = {https://ijcai.org/proceedings/1997/187},
}

TY  - CPAPER
TI  - Mini-Buckets: A General Scheme for Generating Approximations in Automated Reasoning
AU  - Dechter, Rina
T2  - Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence, IJCAI-97
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1997
SP  - 1297
EP  - 1302
UR  - https://ijcai.org/proceedings/1997/187
ER  -