| No. |
Title |
Author |
Year |
| 1 |
Simple Derivation Systems for Proving Sufficient Completeness of Non-Terminating Term Rewriting Systems |
Kikuchi, Kentaro et al. |
2021 |
| 2 |
A Fast Decision Procedure For Uniqueness of Normal Forms w.r.t. Conversion of Shallow Term Rewriting Systems |
Yamaguchi, Masaomi et al. |
2020 |
| 3 |
Confluence Competition 2018 |
Aoto, Takahito et al. |
2018 |
| 4 |
Improving Rewriting Induction Approach for Proving Ground Confluence |
Aoto, Takahito et al. |
2017 |
| 5 |
Ground Confluence Prover based on Rewriting Induction |
Aoto, Takahito et al. |
2016 |
| 6 |
Confluence of Orthogonal Nominal Rewriting Systems Revisited |
Suzuki, Takaki et al. |
2015 |
| 7 |
A Reduction-Preserving Completion for Proving Confluence of Non-Terminating Term Rewriting Systems |
Aoto, Takahito et al. |
2011 |
| 8 |
Natural Inductive Theorems for Higher-Order Rewriting |
Aoto, Takahito et al. |
2011 |
| 9 |
Automated Confluence Proof by Decreasing Diagrams based on Rule-Labelling |
Aoto, Takahito |
2010 |
| 10 |
Sound Lemma Generation for Proving Inductive Validity of Equations |
Aoto, Takahito |
2008 |
