Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
Theoretical Computer Science - Special issue on selected papers of the International Workshop on Computing by Graph Transformation, Bordeaux, France, March 21–23, 1991
Hyperedge replacement graph grammars
Handbook of graph grammars and computing by graph transformation
Term rewriting and all that
Science of Computer Programming
Hyperedge Replacement: Grammars and Languages
Hyperedge Replacement: Grammars and Languages
Introduction to Algorithms
A Compiler for Rewrite Programs in Associative-Commutative Theories
PLILP '98/ALP '98 Proceedings of the 10th International Symposium on Principles of Declarative Programming
Proceedings of the International Workshop on Graph Transformations in Computer Science
An Algebra of Graphs and Graph Rewriting
Proceedings of the 4th International Conference on Category Theory and Computer Science
Journal of Functional Programming
A rule-based approach for automated generation of kinetic chemical mechanisms
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Automated generation of kinetic chemical mechanisms using rewriting
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
A Rewriting Calculus for Multigraphs with Ports
Electronic Notes in Theoretical Computer Science (ENTCS)
Attenuation regulation as a term rewriting system
AB'07 Proceedings of the 2nd international conference on Algebraic biology
| Hi-index | 0.00 |
In this paper, rule-based programming is explored in the field of automated generation of chemical reaction mechanisms. We explore a class of graphs and a graph rewriting relation where vertices are preserved and only edges are changed. We show how to represent cyclic labeled graphs by decorated labeled trees or forests, then how to transform trees into terms. A graph rewriting relation is defined, then simulated by a tree rewriting relation, which can be in turn simulated by a rewriting relation on equivalence classes of terms. As a consequence, this kind of graph rewriting can be implemented using term rewriting. This study is motivated by the design of the GasEl system for the generation of kinetics reactions mechanisms. In GasEl, chemical reactions correspond to graph rewrite rules and are implemented by conditional rewriting rules in ELAN. The control of their application is done through the ELAN strategy language.