Generalized AND/OR graphs

DOI10.1016/0004-3702(76)90006-0MaRDI QIDQ1228371zbMATH OpenOpenAlexFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3466555 (Why is no real title available?)
• scientific article; zbMATH DE number 3303642 (Why is no real title available?)
• An admissible and optimal algorithm for searching AND/OR graphs
• Equivalence between AND/OR graphs and context-free grammars
• State-space problem-reduction, and theorem proving—some relationships

Cited in

(8)

• Computing the throughput of concatenation state machines
• The \(PN^{*}\)-search algorithm: Application to tsume-shogi
• On branching and looping. I
• Directed hypergraphs and applications
• An integrated model of problem solver
• The why, how, and when of representations for complex systems
• 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

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

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