Graph grammars and logic programming

DOI10.1007/BFB0017392MaRDI QIDQ4037311zbMATH OpenFDO

Authors Andrea Corradini, Ugo Montanari, Francesca Rossi, Hartmut Ehrig, Michael Löwe

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/BFB0017392

zbMATH Keywords

context-free graph grammarcontext-free hypergraph grammargraph grammarshypergraphslogic programmingoperational semanticsterm rewriting systems

Mathematics Subject Classification ID

Hypergraphs (05C65) Logic programming (68N17) Grammars and rewriting systems (68Q42) Stochastic programming (90C15)

Recommendations

• Logic programming as hypergraph rewriting
• Relating logic programs and attribute grammars
• scientific article; zbMATH DE number 4180778
• scientific article; zbMATH DE number 4049096
• scientific article; zbMATH DE number 4047165

Cited in

(25)

• Computation graphs for actor grammars
• Logical description of context-free graph languages
• Interactive graph grammar
• On the equivalence and range of applicability of graph-based representations of logic programs.
• A calculus of concurrent graph-rewriting processes
• Logic programming as hypergraph rewriting
• scientific article; zbMATH DE number 4180778 (Why is no real title available?)
• Ugo Montanari and Graph Transformation
• On the Expressive Power of Graph Logic
• scientific article; zbMATH DE number 3978424 (Why is no real title available?)
• On the relationship between indexed grammars and logic programs
• Logic Programming with Graph Automorphism: Integratingnautywith Prolog (Tool Description)
• scientific article; zbMATH DE number 809162 (Why is no real title available?)
• scientific article; zbMATH DE number 919847 (Why is no real title available?)
• scientific article; zbMATH DE number 1406165 (Why is no real title available?)
• Graph Grammar Extraction from Source Code
• Graph grammars, a new paradigm for implementing visual languages
• Jungle rewriting: an abstract description of a lazy narrowing machine
• Parallelism in single-pushout graph rewriting
• Contextual occurrence nets and concurrent constraint programming
• Graph theoretical structures in logic programs and default theories
• Symbol -- relation grammars: A formalism for graphical languages
• Graph rewriting for a partial ordering semantics of concurrent constraints programming
• Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
• The power of programmed grammars with graphs from various classes

This page was built for publication: Graph grammars and logic programming

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