The termination hierarchy for term rewriting
From MaRDI portal
Publication:5941751
DOI10.1007/s002000100061zbMath0973.68099OpenAlexW2165079210MaRDI QIDQ5941751
Publication date: 26 August 2001
Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/18963
Related Items (7)
Decreasing diagrams with two labels are complete for confluence of countable systems ⋮ Beyond polynomials and Peano arithmetic -- automation of elementary and ordinal interpretations ⋮ Match-bounded string rewriting systems ⋮ Multi-dimensional interpretations for termination of term rewriting ⋮ Tuple interpretations for termination of term rewriting ⋮ Term orderings for non-reachability of (conditional) rewriting ⋮ Domain expansion for ASP-programs with external sources
This page was built for publication: The termination hierarchy for term rewriting
