Search in artificial intelligence (Q4040217)

The articles of this volume will not be indexed individually. From the preface: ``Search is an important component of problem solving in artificial intelligence (AI) and, more generally, in computer science, engineering and operations research. Combinatorial optimization, decision analysis, game playing, learning, planning, pattern recognition, robotics and theorem proving are some of the areas in which search algorithms play a key role. The articles in this book should provide the reader a broad view of recent developments on search in AI and some relationships among different search algorithms. The new insights and developments provided by this volume should also be helpful to researchers in parallel search algorithms''. Contents: \textit{V. Kumar} and \textit{L. Kanal}, The CDP: a unifying formulation for heuristic search, dynamic programming, and branch-and-bound (pp. 1--27); \textit{P. Helman}, An algebra for search problems and their solutions (pp. 28--90); \textit{V. Kumar}, \textit{D. S. Nau} and \textit{L. Kanal}, A general branch-and-bound formulation for AND/OR graph and game tree search (pp. 91--130); \textit{A. Bagchi} and \textit{A. K. Sen}, Average-case analysis of heuristic search in tree-like networks (pp. 131--165); \textit{R. Dechter} and \textit{J. Pearl}, The optimality of \(A^*\) (pp. 166--199); \textit{A. Mahanti} and \textit{K. Ray}, Network search algorithms with modifiable heuristics (pp. 200--222); \textit{R. Korf}, Optimal path finding algorithms (pp. 223--267); \textit{R. B. Banerji} and \textit{G. W. Ernst}, Developments with GPS (pp. 268--286); \textit{B. Nadel}, Tree search and arc consistency in constraint satisfaction algorithms (pp. 287--342); \textit{E. Freuder}, Backtrack-free and backtrack-bounded search (pp. 343--369); \textit{R. Dechter} and \textit{J. Pearl}, Network-based heuristics for constraint-satisfaction problems (pp. 370--425); \textit{U. Montanari} and \textit{F. Rossi}, Fundamental properties of networks of constraints: a new formulation (pp. 426--449); \textit{P. Chi} and \textit{D. S. Nau}, Comparison of the MINIMAX and PRODUCT back-up rules in a variety of games (pp. 450--472).