Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search

DOI10.1016/0004-3702(94)90020-5zbMath0803.68123OpenAlexW2051199238MaRDI QIDQ1321063

Partha Pratim Chakrabarti

Publication date: 3 May 1994

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(94)90020-5

zbMATH Keywords

graph searchproblem decompositionAND/OR graphs\(\text{AO}^*\)

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (5)

Solving job shop problems in the context of hypergraphs ⋮ Searching for a minimal solution subgraph in explicit AND/OR graphs ⋮ The \(PN^{*}\)-search algorithm: Application to tsume-shogi ⋮ Heuristic search in restricted memory ⋮ An efficient algorithm for searching implicit AND/OR graphs with cycles

Cites Work

• Admissibility of \(AO^ *\) when heuristics overestimate
• Generalized best first search using single and multiple heuristics
• Heuristic search in restricted memory
• AND/OR graph heuristic search methods
• Optimizing decision trees through heuristically guided search
• Unnamed Item

This page was built for publication: Algorithms for searching explicit AND/OR graphs and their applications to problem reduction search