This paper summarizes work on a general bottom-up procedure for searching AND/OR graphs which includes a number of procedure for seaching 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 procedures.
|Original language||English (US)|
|Title of host publication||Unknown Host Publication Title|
|Publisher||American Assoc for Artificial Intelligence, USA. Distributed by William Kaufmann Inc|
|Number of pages||6|
|State||Published - Dec 1 1983|