A general heuristic bottom-up procedure for searching AND/OR graphs

DOI10.1016/0020-0255(91)90023-NzbMath0718.68059MaRDI QIDQ2639647

Vipin Kumar

Publication date: 1991

Published in: Information Sciences (Search for Journal in Brave)

zbMATH Keywords

AND/OR graphheuristic bottom-up procedure

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (max. 100)

An efficient algorithm for searching implicit AND/OR graphs with cycles

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• General branch and bound, and its relation to \(A^*\) and \(AO^*\)
• Admissible heuristic search in AND/OR graphs
• A minimax algorithm better than alpha-beta?
• The art and theory of dynamic programming
• A generalization of Dijkstra's algorithm
• A general branch and bound formulation for understanding and synthesizing And/Or tree search procedures
• Solvable classes of discrete dynamic programming
• AND/OR graph heuristic search methods
• Dynamic Programming as Graph Searching: An Algebraic Approach
• State-space problem-reduction, and theorem proving—some relationships
• Branch-and-Bound Strategies for Dynamic Programming
• Optimizing decision trees through heuristically guided search
• Equivalence between AND/OR graphs and context-free grammars

This page was built for publication: A general heuristic bottom-up procedure for searching AND/OR graphs