An admissible and optimal algorithm for searching AND/OR graphs

DOI10.1016/0004-3702(71)90006-3MaRDI QIDQ2549574zbMATH OpenOpenAlexFDO

Authors Yanyan Li

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

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Cites work

• A Heuristic Program that Solves Symbolic Integration Problems in Freshman Calculus
• A Planning Problem Solver Based on Look-Ahead in Stochastic Game Trees
• Experiments With a Multipurpose, Theorem-Proving Heuristic Program
• Experiments With Some Programs That Search Game Trees
• Finding resolution proofs and using duplicate goals in AND/OR trees
• scientific article; zbMATH DE number 3219315 (Why is no real title available?)
• scientific article; zbMATH DE number 3273527 (Why is no real title available?)
• scientific article; zbMATH DE number 3275610 (Why is no real title available?)
• scientific article; zbMATH DE number 3331276 (Why is no real title available?)
• scientific article; zbMATH DE number 3185223 (Why is no real title available?)

Cited in

(20)

• 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*
• Knowledge versus search: a quantitative analysis using A*
• Optimal problem-solving search: All-or-none solutions
• 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 efficient algorithm for searching implicit AND/OR graphs with cycles
• The heuristic search under conditions of error
• A label correcting algorithm for partial disassembly sequences in the production planning for end-of-life products
• Computer science and decision theory
• An \(\mathrm{AO}^{*}\) based exact algorithm for the Canadian traveler problem
• scientific article; zbMATH DE number 7378361 (Why is no real title available?)
• ANALYZING VULNERABILITIES OF CRITICAL INFRASTRUCTURES USING FLOWS AND CRITICAL VERTICES IN AND/OR GRAPHS
• Minimal disclosure in hierarchical Hippocratic databases with delegation
• Searching for a minimal solution subgraph in explicit AND/OR graphs
• The \(PN^{*}\)-search algorithm: Application to tsume-shogi

This page was built for publication: An admissible and optimal algorithm for searching AND/OR graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2549574)