Guided Unfoldings for Finding Loops in Standard Term Rewriting - Université de La Réunion Access content directly
Conference Papers Year : 2019

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 modify it by guiding the unfolding process, using disagreement pairs in rewrite rules. This results in a partial computation of the unfoldings, whereas the original technique consists of a thorough computation followed by a mechanism for eliminating some rules. We have implemented this new approach in our tool NTI and conducted successful experiments on a large set of term rewrite systems.
Fichier principal
Vignette du fichier
lopstr18.pdf (352.31 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-04458773 , version 1 (15-02-2024)

Identifiers

Cite

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⟩
14 View
4 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More