2 research outputs found
Notes on Lynch-Morawska Systems
In this paper we investigate convergent term rewriting systems that conform
to the criteria set out by Christopher Lynch and Barbara Morawska in their
seminal paper "Basic Syntactic Mutation." The equational unification problem
modulo such a rewrite system is solvable in polynomial-time. In this paper, we
derive properties of such a system which we call an -system. We show, in
particular, that the rewrite rules in an -system have no left- or
right-overlaps. We also show that despite the restricted nature of an
-system, there are important undecidable problems, such as the deduction
problem in cryptographic protocol analysis (also called the the cap problem)
that remain undecidable for -systems
Termination is not Modular for Confluent Variable-Preserving Term Rewriting Systems
Introduction A term rewriting system (TRS for short) is a pair (F ; R) consisting of a signature F and a set R of rewrite rules [1, 4]. Every rewrite rule l ! r 2 R, where l; r are terms from T (F ; V), must satisfy the following two constraints: (i) l is not a variable, and (ii) variables occurring in r also occur in l. Two TRSs are disjoint if their signatures are disjoint. A property P of TRSs is called modular, if for all disjoint TRSs (F 1 ; R 1 ) and (F 2 ; R 2 ) their disjoint union (F 1 ]F 2 ; R 1 ] R 2 ) has the property P if and only if both (F 1 ;<F3