The Relationship Between AND/OR Search and Variable Elimination
Robert Mateescu, Rina Dechter
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  and Value Elimination  within the AND/OR search framework.
PDF Link: /papers/05/p380-mateescu.pdf
AUTHOR = "Robert Mateescu
and Rina Dechter",
TITLE = "The Relationship Between AND/OR Search and Variable Elimination",
BOOKTITLE = "Proceedings of the Twenty-First Conference Annual Conference on Uncertainty in Artificial Intelligence (UAI-05)",
PUBLISHER = "AUAI Press",
ADDRESS = "Arlington, Virginia",
YEAR = "2005",
PAGES = "380--387"