Generalized AND/OR graphs

DOI10.1016/0004-3702(76)90006-0zbMath0333.68063OpenAlexW2058727463MaRDI QIDQ1228371

Giorgio Levi, Franco Sirovich

Publication date: 1976

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

Full work available at URL: https://doi.org/10.1016/0004-3702(76)90006-0

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Algorithms in computer science (68W99)

Related Items

On branching and looping. I ⋮ Generating functions of some families of directed uniform hypergraphs ⋮ A label correcting algorithm for partial disassembly sequences in the production planning for end-of-life products ⋮ Computing the throughput of concatenation state machines ⋮ The \(PN^{*}\)-search algorithm: Application to tsume-shogi ⋮ An integrated model of problem solver ⋮ Directed hypergraphs and applications ⋮ The Why, How, and When of Representations for Complex Systems

Cites Work

• An admissible and optimal algorithm for searching AND/OR graphs
• State-space problem-reduction, and theorem proving—some relationships
• Equivalence between AND/OR graphs and context-free grammars
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalized AND/OR graphs