Termination analysis of logic programs using acceptability with general term orders

Alexander Serebrenik, Danny De Schreye

We present a new approach to termination analysis of logic programs. The essence of the approach is that we make use of general term-orderings (instead of level mappings), like it…