How can the notion of well-rewrite-ordering be used to as the basis for some new kind of ``recursive path ordering''?

The source page states the original problem together with its recorded qualifications and progress updates as follows.

In [Lescanne, 1991] an extension of term embedding, called well-rewrite orderings'', was introduced, leading to an extension of the concept of simplification ordering. How can those ideas best be extended to form the basis for some new kind of recursive path ordering''?

Recorded progress.

Progress in this direction has been reported in [Lescanne, 1991].