HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

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).
Complete list of metadata

Cited literature [11 references]  Display  Hide  Download

Contributor : Réunion Univ Connect in order to contact the contributor
Submitted on : Monday, November 5, 2018 - 9:33:04 AM
Last modification on : Wednesday, November 3, 2021 - 4:26:38 AM
Long-term archiving on: : Wednesday, February 6, 2019 - 1:42:25 PM


Files produced by the author(s)


  • HAL Id : hal-01912030, version 1
  • ARXIV : 1808.05065



Etienne Payet. Guided Unfoldings for Finding Loops in Standard Term Rewriting. 2018. ⟨hal-01912030⟩



Record views


Files downloads