Bounding Search Space Size via (Hyper)tree Decompositions

Lars Otten, Rina Dechter

This paper develops a measure for bounding the performance of AND/OR search algorithms for solving a variety of queries over graphical models. We show how drawing a connection to t…