An admissible and optimal algorithm for searching AND/OR graphs
From MaRDI portal
Publication:2549574
DOI10.1016/0004-3702(71)90006-3zbMath0227.68016OpenAlexW2014355235MaRDI QIDQ2549574
Publication date: 1971
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0004-3702(71)90006-3
Related Items
A generalization of alpha-beta and \(SSS^*\) search procedures, On branching and looping. I, A method for computing heuristics in problem solving, Probabilistic analysis of the complexity of A*, Unnamed Item, A label correcting algorithm for partial disassembly sequences in the production planning for end-of-life products, Knowledge versus search: a quantitative analysis using A*, ANALYZING VULNERABILITIES OF CRITICAL INFRASTRUCTURES USING FLOWS AND CRITICAL VERTICES IN AND/OR GRAPHS, Searching for a minimal solution subgraph in explicit AND/OR graphs, The \(PN^{*}\)-search algorithm: Application to tsume-shogi, Optimal problem-solving search: All-or-none solutions, Computer science and decision theory, Generalized AND/OR graphs, Semantics in problem representation and search, Problem representations and formal properties of heuristic search, An integrated model of problem solver, An AO* Based Exact Algorithm for the Canadian Traveler Problem, The heuristic search under conditions of error, An efficient algorithm for searching implicit AND/OR graphs with cycles, Minimal Disclosure in Hierarchical Hippocratic Databases with Delegation
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Finding resolution proofs and using duplicate goals in AND/OR trees
- Experiments With a Multipurpose, Theorem-Proving Heuristic Program
- A Planning Problem Solver Based on Look-Ahead in Stochastic Game Trees
- Experiments With Some Programs That Search Game Trees
- A Heuristic Program that Solves Symbolic Integration Problems in Freshman Calculus
