The Relationship Between AND/OR Search and Variable Elimination
Artificial Intelligence
2012-07-09 v1
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 memoryintensive 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.
Keywords
Cite
@article{arxiv.1207.1407,
title = {The Relationship Between AND/OR Search and Variable Elimination},
author = {Robert Mateescu and Rina Dechter},
journal= {arXiv preprint arXiv:1207.1407},
year = {2012}
}
Comments
Appears in Proceedings of the Twenty-First Conference on Uncertainty in Artificial Intelligence (UAI2005)