Proving termination for logic programs by the query-mapping pairs approach (2004)

by N Lindenstrauss, Y Sagiv, A Serebrenik
Venue:In Program Development in Computational Logic. LNCS