Directed recursive labelnode hypergraphs: A new representation-language

DOI10.1016/0004-3702(77)90014-5zbMATH Open0357.68100OpenAlexW1996650547MaRDI QIDQ1239014FDOQ1239014

Authors: Harold Boley 

Publication date: 1977

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

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Pattern recognition, speech recognition (68T10) Directed graphs (digraphs), tournaments (05C20) Classical first-order logic (03B10)

Cites Work

• A relational model of data for large shared data banks
• Efficient Utilization of Non-Numerical Information in Quantitative Analysis General Theory and the Case of Simple Order
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• A language extension for graph processing and its formal semantics
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (8)

• Dynamic maintenance of directed hypergraphs
• Partially dynamic maintenance of minimum weight hyperpaths
• Dynamic maintenance of the transitive closure in disjunctive graphs
• Directed hypergraphs and applications
• Generating functions of some families of directed uniform hypergraphs
• Declarative operations on nets
• Directed hypergraphs: introduction and fundamental algorithms -- a survey
• Linear time analysis of properties of conflict-free and general Petri nets

This page was built for publication: Directed recursive labelnode hypergraphs: A new representation-language

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