Guided Unfoldings for Finding Loops in Standard Term Rewriting
Abstract
In this paper, we reconsider the unfolding-based technique that we have introduced previously for detecting loops in standard term rewriting. We improve it by guiding the unfolding process, using distinguished positions in the rewrite rules. This results in a depth-first computation of the unfoldings, whereas the original technique was breadth-first. We have implemented this new approach in our tool NTI and compared it to the previous one on a bunch of rewrite systems. The results we get are promising (better times, more successful proofs).
Origin | Files produced by the author(s) |
---|
Loading...
![]()
Is part of hal-04458773 Conference output Etienne Payet. Guided Unfoldings for Finding Loops in Standard Term Rewriting. 28th International Symposium on Logic-Based Program Synthesis and Transformation (LOPSTR 2018), Fred Mesnard; Peter J. Stuckey, Sep 2018, Frankfurt/Main, Germany. pp.22-37, ⟨10.1007/978-3-030-13838-7_2⟩. ⟨hal-04458773⟩