SAT solving for termination proofs with recursive path orders and DPs. (2012)

by M Codish, J Giesl, P Schneider-Kamp, R Thiemann
Venue:JAR