@InProceedings{sternagel_et_al:LIPIcs.FSCD.2016.29,
author = {Sternagel, Christian and Sternagel, Thomas},
title = {{Certifying Confluence of Almost Orthogonal CTRSs via Exact Tree Automata Completion}},
booktitle = {1st International Conference on Formal Structures for Computation and Deduction (FSCD 2016)},
pages = {29:1--29:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-010-1},
ISSN = {1868-8969},
year = {2016},
volume = {52},
editor = {Kesner, Delia and Pientka, Brigitte},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSCD.2016.29},
URN = {urn:nbn:de:0030-drops-59996},
doi = {10.4230/LIPIcs.FSCD.2016.29},
annote = {Keywords: certification, conditional term rewriting, confluence, infeasible critical pairs, non-reachability}
}