Abstract
AbstractThe first-order theory of rewriting is decidable for linear variable-separated rewrite systems. We present a new decision procedure which is the basis of , a decision and synthesis tool for properties expressible in the theory. The decision procedure is based on tree automata techniques and verified in Isabelle. Several extensions make the theory more expressive and more versatile. We present a certificate language that enables the output of to be certified by the certifier generated from the formalization, and we provide extensive experiments.
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computational Theory and Mathematics,Software