A General Bottom-up Procedure for Searching And/Or Graphs

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 procedures.

[1]  Alberto Martelli,et al.  On the Complexity of Admissible Search Algorithms , 1977, Artif. Intell..

[2]  Patrick A. V. Hall,et al.  Equivalence between AND/OR graphs and context-free grammars , 1973, Commun. ACM.

[3]  T. Ibaraki.  Solvable classes of discrete dynamic programming , 1973 .

[4]  Vipin Kumar,et al.  General Branch and Bound, and its Relation to A and AO , 1984, Artif. Intell..

[5]  George C. Stockman,et al.  A Minimax Algorithm Better than Alpha-Beta? , 1979, Artif. Intell..

[6]  Nils J. Nilsson,et al.  Principles of Artificial Intelligence , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Donald E. Knuth,et al.  A Generalization of Dijkstra's Algorithm , 1977, Inf. Process. Lett..

[8]  Vipin Kumar.  A unified approach to problem solving search procedures , 1982 .

[9]  Vipin Kumar,et al.  Parallel Branch-and-Bound Formulations for AND/OR Tree Search , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[10]  Hans J. Berliner,et al.  The B* Tree Search Algorithm: A Best-First Proof Procedure , 1979, Artif. Intell..

[11]  Patrick A. V. Hall.  Branch-and-Bound and Beyond , 1971, IJCAI.

[12]  Vipin Kumar,et al.  The Composite Decision Process: A Unifying Formulation for Heuristic Search, Dynamic Programming and Branch & Bound Procedures , 1983, AAAI.

[13]  Thomas L. Morin,et al.  Branch-and-Bound Strategies for Dynamic Programming , 2015, Oper. Res..

[14]  Vipin Kumar,et al.  A General Branch and Bound Formulation for Understanding and Synthesizing And/Or Tree Search Procedures , 1983, Artif. Intell..

[15]  Alberto Martelli,et al.  Optimizing decision trees through heuristically guided search , 1978, CACM.

[16]  Alberto Martelli,et al.  Additive AND/OR Graphs , 1973, IJCAI.

[17]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[18]  A. Unwin.  The Art and Theory of Dynamic Programming , 1979 .

[19]  Alberto Martelli,et al.  Dynamic Programming as Graph Searching: An Algebraic Approach , 1981, JACM.

[20]  László Méro.  Some Remarks on Heuristic Search Algorithms , 1981, IJCAI.