An admissible and optimal algorithm for searching AND/OR graphs

DOI10.1016/0004-3702(71)90006-3zbMATH Open0227.68016OpenAlexW2014355235MaRDI QIDQ2549574FDOQ2549574

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

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

Cites Work

• Title not available (Why is that?)
• Experiments With Some Programs That Search Game Trees
• Title not available (Why is that?)
• Experiments With a Multipurpose, Theorem-Proving Heuristic Program
• A Heuristic Program that Solves Symbolic Integration Problems in Freshman Calculus
• Title not available (Why is that?)
• Finding resolution proofs and using duplicate goals in AND/OR trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Planning Problem Solver Based on Look-Ahead in Stochastic Game Trees

Cited In (20)

• The \(PN^{*}\)-search algorithm: Application to tsume-shogi
• Generalized AND/OR graphs
• Knowledge versus search: a quantitative analysis using A*
• An efficient algorithm for searching implicit AND/OR graphs with cycles
• Minimal Disclosure in Hierarchical Hippocratic Databases with Delegation
• ANALYZING VULNERABILITIES OF CRITICAL INFRASTRUCTURES USING FLOWS AND CRITICAL VERTICES IN AND/OR GRAPHS
• On branching and looping. I
• Optimal problem-solving search: All-or-none solutions
• Title not available (Why is that?)
• Semantics in problem representation and search
• Probabilistic analysis of the complexity of A*
• An integrated model of problem solver
• The heuristic search under conditions of error
• An \(\mathrm{AO}^{*}\) based exact algorithm for the Canadian traveler problem
• A method for computing heuristics in problem solving
• Problem representations and formal properties of heuristic search
• A label correcting algorithm for partial disassembly sequences in the production planning for end-of-life products
• Searching for a minimal solution subgraph in explicit AND/OR graphs
• Computer science and decision theory
• A generalization of alpha-beta and \(SSS^*\) search procedures

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)