Confluence of Non-Left-Linear TRSs via Relative Termination-Reference-Cited by-同舟云学术

Confluence of Non-Left-Linear TRSs via Relative Termination

Published:2012 Issue: Volume: Page:258-273
ISSN:0302-9743
Container-title:Logic for Programming, Artificial Intelligence, and Reasoning
language:
Short-container-title:

Author:

Klein Dominik,Hirokawa Nao

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-28717-6_21.pdf

Reference28 articles.

1. Aoto, T., Toyama, Y.: Persistency of confluence. Journal of Universal Computer Science 3(11), 1134–1147 (1997)

2. Aoto, T., Toyama, Y.: A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems. In: Proc. 22nd RTA. LIPIcs, vol. 10, pp. 91–106 (2011)

3. Lecture Notes in Computer Science;T. Aoto,2009

4. Baader, F., Nipkow, T.: Term rewriting and all that. Cambridge University Press (1998)

5. Felgenhauer, B., Zankl, H., Middeldorp, A.: Layer systems for proving confluence. In: Proc. 31st FSTTCS. LIPIcs, vol. 13, pp. 288–299 (2011)

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Dependency Pair Framework for Relative Termination of Term Rewriting;Lecture Notes in Computer Science;2024

2. Automated Proofs of Unique Normal Forms w.r.t. Conversion for Term Rewriting Systems;Frontiers of Combining Systems;2019

3. A Formally Verified Solver for Homogeneous Linear Diophantine Equations;Interactive Theorem Proving;2018

4. CSI: New Evidence – A Progress Report;Automated Deduction – CADE 26;2017

5. Certification of Classical Confluence Results for Left-Linear Term Rewrite Systems;Interactive Theorem Proving;2016