Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems.

Martin Korp, Aart Middeldorp

Browse the full LATA paper archive.