1. Termination of term rewriting using dependency pairs;Arts;Theoretical Computer Science,2000
2. Commutation, transformation, and termination;Bachmair,1986
3. Termination by completion;Bellegarde;Applicable Algebra in Engineering, Communication and Computing,1990
4. The computability path ordering: the end of a quest;Blanqui,2008
5. Program termination and well partial orderings;Blass;ACM Transactions on Computational Logic,2008