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

DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI