10 citations · 11 across the 3 of their papers we have counts for
3 papers · 1 filter
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…
Polynomial Interpretations over the Natural, Rational and Real Numbers Revisited
Friedrich Neurauter, Aart Middeldorp
Polynomial interpretations are a useful technique for proving termination of term rewrite systems. They come in various flavors: polynomial interpretations with real, rational and…
Layer Systems for Proving Confluence
Bertram Felgenhauer, Aart Middeldorp, Harald Zankl +1
We introduce layer systems for proving generalizations of the modularity of confluence for first-order rewrite systems. Layer systems specify how terms can be divided into layers.…