Name
Abstract | ||
|---|---|---|
The graph rewriting calculus is an extension of the @r-calculus, handling graph like structures rather than simple terms. The calculus over terms is naturally generalized by using unification constraints in addition to the standard @r-calculus matching constraints. The transformations are performed by explicit application of rewrite rules as first class entities. The possibility of expressing sharing and cycles allows one to represent and compute over regular infinite entities. We propose in this paper a reduction strategy for the graph rewriting calculus which aims at maintaining the sharing information as long as possible in the terms. The corresponding reduction relation is shown to be confluent and complete w.r.t. the small-step semantics of the graph rewriting calculus. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.entcs.2008.03.057 | Electr. Notes Theor. Comput. Sci. |
Keywords | Field | DocType |
graph rewriting calculus,reduction strategy,unification constraint,sharing information,confluence,small-step semantics,rewriting calculus,explicit application,matching and unification constraints,term graphs,sharing,regular infinite entity,corresponding reduction relation,complete w,reduction strategies,class entity,simple term,graph rewriting | Reduction strategy,Discrete mathematics,Computer science,Unification,Theoretical computer science,Null graph,First class,Confluence,Graph rewriting,Clique-width,Calculus,Semantics | Journal |
Volume | ISSN | Citations |
204, | Electronic Notes in Theoretical Computer Science | 2 |
PageRank | References | Authors |
0.38 | 14 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| P. Baldan | 1 | 51 | 4.13 |
| C. Bertolissi | 2 | 11 | 0.93 |
| H. Cirstea | 3 | 11 | 0.93 |
| C. Kirchner | 4 | 2 | 0.38 |