Abstract
This paper presents a general heuristic bottom-up procedure for finding a least-cost solution tree of an AND/OR graph when the cost functions associated with the arcs are monotone. Since monotone cost functions are very general, the procedure is applicable to a very large number of problems. The procedure works for both cyclic and acyclic AND/OR graphs, and subsumes most of the known bottom-up procedures for searching AND/OR graphs. Many state-space search procedures and dynamic programming procedures are also special cases of this procedure.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 39-57 |
| Number of pages | 19 |
| Journal | Information Sciences |
| Volume | 56 |
| Issue number | 1-3 |
| DOIs | |
| State | Published - Aug 1991 |
Bibliographical note
Funding Information:This work was supported in part by Army Research the Artificial Intelligence Laboratory at the University was on the faculty at the University of Texas.