Graph rewriting with unification and composition

  • Francesco Parisi-Presicce
  • Hartmut Ehrig
  • Ugo Montanari
Part II Technical Contributions
Part of the Lecture Notes in Computer Science book series (LNCS, volume 291)


The standard Algebraic Theory of Graph Grammars is based on the notion of "color-preserving" graph morphisms and on a "double pushout" construction to represent gluing of graphs. In this paper, we impose a simple structure on the sets of colors to allow variables in both graphs and productions. Instantiations are performed by graph morphisms. Using relative unification, we define the composition of rules and prove the Concurrency Theorem in this more general framework. By restricting our attention to rooted directed acyclic graphs, we can represent standard Term Rewriting with First order substitutions. One of the motivations for this study is the attempt to provide a description of the static behavior of Rule-Based Expert Systems.


Consistency Condition Graph Production Labelling Function Labelling Condition Graph Grammar 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [BFH 85]
    Boehm P., Fonio H.-R., Habel A., Amalgamation of Graph Transformations with applications to Synchronization, Proc. CAAP 85, LNCS 185 (1985) 267–283Google Scholar
  2. [CER 79]
    Claus V., Ehrig H., Rozenberg G. (eds.): Graph grammars and Their Applications to Computer Science and Biology, Proc. Internat. Workshop, LNCS 73 (1979)Google Scholar
  3. [CM 83]
    Castellani I., Montanari U., Graph Grammars for Distributed Systems, Proc. 2nd Int. Workshop on Graph Grammars, LNCS 153 (1983) 20–38Google Scholar
  4. [DK 77]
    Davis R., King J., An Overview of Production Systems, in "Machine Intelligence" vol.8 (eds. E.W. Elcock and D.Michie), 1977Google Scholar
  5. [Eh 79]
    Ehrig H., Introduction to the Algebraic Theory of Graph Grammars, Proc. Int. Workshop on Graph Grammars, LNCS 73 (1979) 1–69Google Scholar
  6. [EHR 86]
    Ehrig H., Habel A., Rosen B.K., Concurrent Transformations of Relational Structures, Fund. Inform. IX (1) 1986.Google Scholar
  7. [ER 80]
    Ehrig H., Rosen B.K., Parallelism and Concurrency of Graph Manipulations, Theoret. Comp. Sci. 11 (1980) 247–275CrossRefGoogle Scholar
  8. [ENR 83]
    Ehrig H., Nagl M., Rozenberg G. (eds.): Graph Grammars and Their Applications to Computer Science, Proc. 2nd Internat. Workshop, LNCS 153 (1983)Google Scholar
  9. [H 80]
    Huet G., Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems, JACM 27, 4 (Oct 1980) 797–821CrossRefGoogle Scholar
  10. [HO 80]
    Huet G., Oppen D. C., Equations and Rewrite Rules: A Survey, in "Formal Language Theory: Perspective and Open Problems" ed. R.Book, Academic Press 1980Google Scholar
  11. [H-R 85]
    Hayes-Roth F., Rule-Based Systems, Comm. ACM 28,9 (Sept 1985) 921–932Google Scholar
  12. [NA 87]
    Nivat M., Ait-Kaci H., Eds., Proc. Colloquium on the Resolution of Equations in Algebraic Structures, Lakeway, Texas, May 4–6 1987, to appear.Google Scholar
  13. [S 86]
    Sandewall E., Nonmonotonic Inference Rules for Multiple Inheritance with Exceptions, IEEE Proceedings 74, 10 (Oct 1986) 1345–1353Google Scholar
  14. [T 86]
    Touretzky D. S., The Mathematics of Inheritance Systems, Pitman, London, 1986Google Scholar
  15. [V 77]
    Vere S.A., Relational Production Systems, Artificial Intelligence 8 (1977) 47–68Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Francesco Parisi-Presicce
    • 1
  • Hartmut Ehrig
    • 2
  • Ugo Montanari
    • 3
  1. 1.Department of MathematicsUniv. of Southern CaliforniaLos Angeles
  2. 2.Technische Univ.BerlinBerlin 10
  3. 3.Dipartimento di InformaticaUniv. di PisaPisa

Personalised recommendations