Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming
Theoretical Computer Science
Corradini, A. and F. Rossi, Hyperedge replacement jungle rewriting for term-rewriting systems and logic programming, Theoretical Computer Science 109 (1993) 7-48. We introduce hyperedge replacement jungle rewriting, a graph-rewriting formalism suitable for modeling the manipulation of terms and similar structures, and investigate its expressive power by showing that it can model both term-rewriting systems and logic programming in a faithful way. For term-rewriting systems we prove the
... of their jungle representation, and a result of completeness w.r.t. applicability which is stronger than similar results in the related literature, since it works also for non-left-linear rules. For logic programming both soundness and completeness hold. Introduction In this paper we investigate the properties of hyperedge replacement jungle rewriting, a formalism based on graph rewriting, and demonstrate its expressive power, showing that it can model faithfully both term-rewriting systems (TRSs) and logic programming. Jungles are special acyclic directed hypergraphs (i.e., graphs where each edge can have any number of source and target nodes), and have been introduced in [29,20] to represent sets of terms with possibly shared subterms. In this sense they can be thought of as being the hypergraph corresponding to the well-known directed acyclic graphs (days) (see  ).