The Relationship Between AND/OR Search and Variable Elimination
Abstract
In this paper we compare search and inference in graphical models through the new framework of AND/OR search. Specifically, we compare Variable Elimination (VE) and memory-intensive AND/OR Search (AO) and place algorithms such as graph-based backjumping and no-good and good learning, as well as Recursive Conditioning [7] and Value Elimination [2] within the AND/OR search framework.
Cite
Text
Mateescu and Dechter. "The Relationship Between AND/OR Search and Variable Elimination." Conference on Uncertainty in Artificial Intelligence, 2005.Markdown
[Mateescu and Dechter. "The Relationship Between AND/OR Search and Variable Elimination." Conference on Uncertainty in Artificial Intelligence, 2005.](https://mlanthology.org/uai/2005/mateescu2005uai-relationship/)BibTeX
@inproceedings{mateescu2005uai-relationship,
title = {{The Relationship Between AND/OR Search and Variable Elimination}},
author = {Mateescu, Robert and Dechter, Rina},
booktitle = {Conference on Uncertainty in Artificial Intelligence},
year = {2005},
pages = {380-387},
url = {https://mlanthology.org/uai/2005/mateescu2005uai-relationship/}
}