LIPIcs - Leibniz International Proceedings in Informatics. 1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016)
Doi
Abstract
The first-order theory of rewriting is decidable for finite left-linear
right-ground rewrite systems. We present a new tool that implements the
decision procedure for this theory. It is based on tree automata
techniques. The tool offers the possibility to synthesize rewrite systems
that satisfy properties that are expressible in the first-order theory of
rewriting
