Proof Orders for Decreasing Diagrams

Felgenhauer, Bertram; van Oostrom, Vincent

doi:10.4230/LIPIcs.RTA.2013.174

Document

Proof Orders for Decreasing Diagrams

Authors Bertram Felgenhauer, Vincent van Oostrom

Part of: Volume: 24th International Conference on Rewriting Techniques and Applications (RTA 2013)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: Conference: International Conference on Rewriting Techniques and Applications (RTA)
License: Creative Commons Attribution 3.0 Unported license
Publication Date: 2013-06-24

PDF

File

PDF

LIPIcs.RTA.2013.174.pdf

Filesize: 0.65 MB
16 pages

Document Identifiers

DOI: 10.4230/LIPIcs.RTA.2013.174
URN: urn:nbn:de:0030-drops-40616

Subject Classification

Keywords

involutive monoid
confluence modulo
decreasing diagram
proof order

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Abstract

We present and compare some well-founded proof orders for decreasing diagrams. These proof orders order a conversion above another conversion if the latter is obtained by filling any peak in the former by a (locally) decreasing diagram. Therefore each such proof order entails the decreasing diagrams technique for proving confluence. The proof orders differ with respect to monotonicity and complexity. Our results are developed in the setting of involutive monoids. We extend these results to obtain a decreasing diagrams technique for confluence modulo.

Cite As Get BibTex

Bertram Felgenhauer and Vincent van Oostrom. Proof Orders for Decreasing Diagrams. In 24th International Conference on Rewriting Techniques and Applications (RTA 2013). Leibniz International Proceedings in Informatics (LIPIcs), Volume 21, pp. 174-189, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013) https://doi.org/10.4230/LIPIcs.RTA.2013.174

Author Details

Bertram Felgenhauer

Vincent van Oostrom

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail