The only assumption about the selection rule is that derivations are input-consuming, that is, in each derivation step, the input arguments of the selected atom do not become instantiated. This assumption is a natural abstraction of previous work on programs with delay declarations. The method for showing that a predicate is in that class is based on level mappings, closely following the traditional approach for LDderivations. Programs are assumed to be well and nicely moded, which are two widely used concepts for veri cation.
Many predicates terminate under such weak assumptions.
Proving termination of input-consuming logic programs. In D. De Schreye, editor, 16th International Conference on Logic Programming. MIT press, 1999. Doc 14 an ecient purely declarative logic programming language - Somogyi, Henderson et al. The graph only includes citing articles where the year of publication is known.