| No. |
Title |
Author |
Year |
| 1 |
Formalizing Almost Development Closed Critical Pairs (Short Paper) |
Kohl, Christina et al. |
2023 |
| 2 |
Hydra Battles and AC Termination |
Hirokawa, Nao et al. |
2023 |
| 3 |
Polynomial Termination Over ℕ Is Undecidable |
Mitterwallner, Fabian et al. |
2022 |
| 4 |
Completion for Logically Constrained Rewriting |
Winkler, Sarah et al. |
2018 |
| 5 |
Confluence Competition 2018 |
Aoto, Takahito et al. |
2018 |
| 6 |
ProTeM: A Proof Term Manipulator (System Description) |
Kohl, Christina et al. |
2018 |
| 7 |
Infinite Runs in Abstract Completion |
Hirokawa, Nao et al. |
2017 |
| 8 |
Automating the First-Order Theory of Rewriting for Left-Linear Right-Ground Rewrite Systems |
Rapp, Franziska et al. |
2016 |
| 9 |
Conditional Complexity |
Kop, Cynthia et al. |
2015 |
| 10 |
Improving Automatic Confluence Analysis of Rewrite Systems by Redundant Rules |
Nagele, Julian et al. |
2015 |
| 11 |
Leftmost Outermost Revisited |
Hirokawa, Nao et al. |
2015 |
| 12 |
Beyond Peano Arithmetic – Automatically Proving Termination of the Goodstein Sequence |
Winkler, Sarah et al. |
2013 |
| 13 |
Normalized Completion Revisited |
Winkler, Sarah et al. |
2013 |
| 14 |
Labelings for Decreasing Diagrams |
Zankl, Harald et al. |
2011 |
| 15 |
Layer Systems for Proving Confluence |
Felgenhauer, Bertram et al. |
2011 |
| 16 |
Revisiting Matrix Interpretations for Proving Termination of Term Rewriting |
Neurauter, Friedrich et al. |
2011 |
| 17 |
Optimizing mkbTT |
Winkler, Sarah et al. |
2010 |
| 18 |
Polynomial Interpretations over the Reals do not Subsume Polynomial Interpretations over the Integers |
Neurauter, Friedrich et al. |
2010 |
| 19 |
Implementing RPO and POLO using SAT |
Schneider-Kamp, Peter et al. |
2007 |
