Introduction to graph grammars with applications to semantic networks

DOI10.1016/0898-1221(92)90124-ZzbMath0706.68066MaRDI QIDQ918717

Hans-Joerg Kreowski, Annegret Habel, Hartmut Ehrig

Publication date: 1992

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

graph grammarsrule-based systemssemantic networks

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Knowledge representation (68T30) Grammars and rewriting systems (68Q42)

Related Items

Non-perturbative graph languages, halting problem and complexity ⋮ Unnamed Item ⋮ Declarative operations on nets ⋮ Context-sensitive fusion grammars and fusion grammars with forbidden context are universal

Cites Work

• Hyperedge replacement: grammars and languages
• Graph-grammars and their application to computer science. 3rd International Workshop, Warrenton, Virginia, USA, December 2-6, 1986
• Applications of graph grammar theory to consistency, synchronization and scheduling in data base systems
• Deriving graphs from graphs by applying a production
• Graph-grammars and their application to computer science and biology. International workshop Bad Honnef, October 30 November 3, 1978
• Graph-grammars and their application to computer science. 2nd International Workshop, Haus Ohrbeck, Germany, October 4-8, 1982. Under the auspices of the European Association for Theoretical Computer Science
• Syntactic Recognition of Imperfectly Specified Patterns
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item