LIPIcs.RTA.2015.257.pdf
- Filesize: 0.51 MB
- 12 pages
Document
Improving Automatic Confluence Analysis of Rewrite Systems by Redundant Rules
Authors
-
Part of:
Volume:
26th International Conference on Rewriting Techniques and Applications (RTA 2015)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Conference on Rewriting Techniques and Applications (RTA) - License:
Creative Commons Attribution 3.0 Unported license
- Publication date: 2015-06-18
Cite AsGet BibTex
Julian Nagele, Bertram Felgenhauer, and Aart Middeldorp. Improving Automatic Confluence Analysis of Rewrite Systems by Redundant Rules. In 26th International Conference on Rewriting Techniques and Applications (RTA 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 36, pp. 257-268, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2015)
https://doi.org/10.4230/LIPIcs.RTA.2015.257
https://doi.org/10.4230/LIPIcs.RTA.2015.257
Abstract
We describe how to utilize redundant rewrite rules, i.e., rules that can be simulated by other rules, when (dis)proving confluence of term rewrite systems. We demonstrate how automatic confluence provers benefit from the addition as well as the removal of redundant rules. Due to their simplicity, our transformations were easy to formalize in a proof assistant and are thus amenable to certification. Experimental results show the surprising gain in power.
Keywords
- term rewriting
- confluence
- automation
- transformation
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads