Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Boehm P., Fonio H.-R., Habel A., Amalgamation of Graph Transformations with applications to Synchronization, Proc. CAAP 85, LNCS 185 (1985) 267–283
Claus V., Ehrig H., Rozenberg G. (eds.): Graph grammars and Their Applications to Computer Science and Biology, Proc. Internat. Workshop, LNCS 73 (1979)
Castellani I., Montanari U., Graph Grammars for Distributed Systems, Proc. 2nd Int. Workshop on Graph Grammars, LNCS 153 (1983) 20–38
Davis R., King J., An Overview of Production Systems, in "Machine Intelligence" vol.8 (eds. E.W. Elcock and D.Michie), 1977
Ehrig H., Introduction to the Algebraic Theory of Graph Grammars, Proc. Int. Workshop on Graph Grammars, LNCS 73 (1979) 1–69
Ehrig H., Habel A., Rosen B.K., Concurrent Transformations of Relational Structures, Fund. Inform. IX (1) 1986.
Ehrig H., Rosen B.K., Parallelism and Concurrency of Graph Manipulations, Theoret. Comp. Sci. 11 (1980) 247–275
Ehrig H., Nagl M., Rozenberg G. (eds.): Graph Grammars and Their Applications to Computer Science, Proc. 2nd Internat. Workshop, LNCS 153 (1983)
Huet G., Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems, JACM 27, 4 (Oct 1980) 797–821
Huet G., Oppen D. C., Equations and Rewrite Rules: A Survey, in "Formal Language Theory: Perspective and Open Problems" ed. R.Book, Academic Press 1980
Hayes-Roth F., Rule-Based Systems, Comm. ACM 28,9 (Sept 1985) 921–932
Nivat M., Ait-Kaci H., Eds., Proc. Colloquium on the Resolution of Equations in Algebraic Structures, Lakeway, Texas, May 4–6 1987, to appear.
Sandewall E., Nonmonotonic Inference Rules for Multiple Inheritance with Exceptions, IEEE Proceedings 74, 10 (Oct 1986) 1345–1353
Touretzky D. S., The Mathematics of Inheritance Systems, Pitman, London, 1986
Vere S.A., Relational Production Systems, Artificial Intelligence 8 (1977) 47–68
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1987 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Parisi-Presicce, F., Ehrig, H., Montanari, U. (1987). Graph rewriting with unification and composition. In: Ehrig, H., Nagl, M., Rozenberg, G., Rosenfeld, A. (eds) Graph-Grammars and Their Application to Computer Science. Graph Grammars 1986. Lecture Notes in Computer Science, vol 291. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-18771-5_72
Download citation
DOI: https://doi.org/10.1007/3-540-18771-5_72
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-18771-4
Online ISBN: 978-3-540-48178-2
eBook Packages: Springer Book Archive