A general bottom-up procedure for searching and/or graphs
Vipin Kumar · 1984
This paper summarizes work on a general bottom-up procedure for searching AND/OR graphs which includes a number of procedures for searching AND/OR graphs, state-space graphs, and dynamic programming procedures as its special cases. The paper concludes with comments on the significance of this work in the context of the author’s unified approach to search pro-cedures. 1.