Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
We revisit (un)soundness of transformations of conditional into unconditional rewrite systems. The focus here is on so-called unravelings, the most simple and natural kind of such transformations, for the class of normal conditional systems without extra variables. By a systematic and thorough study of existing counterexamples and of the potential sources of unsoundness we obtain several new positive and negative results. In particular, we prove the following new results: Confluence, non-erasingness and weak left-linearity (of a given conditional system) each guarantee soundness of the unraveled version w.r.t. the original one. The latter result substantially extends the only known sufficient criterion for soundness, namely left-linearity. Furthermore, by means of counterexamples we refute various other tempting conjectures about sufficient conditions for soundness.
@InProceedings{gmeiner_et_al:LIPIcs.RTA.2010.119,
author = {Gmeiner, Karl and Gramlich, Bernhard and Schernhammer, Felix},
title = {{On (Un)Soundness of Unravelings}},
booktitle = {Proceedings of the 21st International Conference on Rewriting Techniques and Applications},
pages = {119--134},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-939897-18-7},
ISSN = {1868-8969},
year = {2010},
volume = {6},
editor = {Lynch, Christopher},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.RTA.2010.119},
URN = {urn:nbn:de:0030-drops-26485},
doi = {10.4230/LIPIcs.RTA.2010.119},
annote = {Keywords: Conditional rewriting, transformation into unconditional systems, unsoundness, unraveling}
}