28 citations · 48 across the 13 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.LO2023
Linear Termination over N is Undecidable
Fabian Mitterwallner, Aart Middeldorp, René Thiemann
Recently it was shown that it is undecidable whether a term rewrite system can be proved terminating by a polynomial interpretation in the natural numbers. In this paper we show th…
cs.LO2023
A Verified Efficient Implementation of the Weighted Path Order
René Thiemann, Elias Wenninger
The Weighted Path Order of Yamada is a powerful technique for proving termination. It is also supported by CeTA, a certifier for checking untrusted termination proofs. To be more p…