Application of graph grammars to rule-based systems

DOI10.1007/BFB0017409MaRDI QIDQ4037324zbMATH OpenFDO

Authors Martin Korff

Publication date 18 May 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0017409

zbMATH Keywords

AI problemsgraph grammarsrule independencyrule-based systemsearch-treessearchingspecifications

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• scientific article; zbMATH DE number 4049117
• On structured graph grammars. I
• scientific article; zbMATH DE number 3845096
• An efficient implementation of graph grammars based on the RETE matching algorithm
• Graph grammars based on node rewriting: An introduction to NLC graph grammars

Cited in

(8)

• Graphs, Rewriting and Pathway Reconstruction for Rule-Based Models
• Matrix Graph Grammars with Application Conditions
• scientific article; zbMATH DE number 4049117 (Why is no real title available?)
• scientific article; zbMATH DE number 67842 (Why is no real title available?)
• scientific article; zbMATH DE number 1930933 (Why is no real title available?)
• scientific article; zbMATH DE number 919847 (Why is no real title available?)
• Single pushout transformations of equationally defined graph structures with applications to actor systems
• Using a graph grammar system in the finite element method

This page was built for publication: Application of graph grammars to rule-based systems

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