2026-08-16T20:56:44Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:3124 2024-03-06T10:33:51Z ddc:004 open_access

Soundness of Unravelings for Deterministic Conditional Term Rewriting Systems via Ultra-Properties Related to Linearity Nishida, Naoki Sakai, Masahiko Sakabe, Toshiki conditional term rewriting program transformation Unravelings are transformations from a conditional term rewriting system (CTRS, for short) over an original signature into an unconditional term rewriting systems (TRS, for short) over an extended signature. They are not sound for every CTRS w.r.t. reduction, while they are complete w.r.t. reduction. Here, soundness w.r.t. reduction means that every reduction sequence of the corresponding unraveled TRS, of which the initial and end terms are over the original signature, can be simulated by the reduction of the original CTRS. In this paper, we show that an optimized variant of Ohlebusch's unraveling for deterministic CTRSs is sound w.r.t. reduction if the corresponding unraveled TRSs are left-linear or both right-linear and non-erasing. We also show that soundness of the variant implies that of Ohlebusch's unraveling. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Naoki Nishida and Masahiko Sakai and Toshiki Sakabe 2011 Is Part Of LIPIcs, Volume 10, 22nd International Conference on Rewriting Techniques and Applications (RTA'11) (2011) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.RTA.2011.267 urn:nbn:de:0030-drops-31244 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2011.267 eng https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode