\documentclass{rtaloop}
\rtalabel{well-rewrite}


\begin{document}
\begin{problem}{Pierre Lescanne}{}{April 1991}

\begin{abstract}
How can the notion of \emph{well-rewrite-ordering} be used to as the basis for
some new kind of ``recursive path ordering''?
\end{abstract}

In \cite{L90:lics} 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''?

\begin{remark}
Progress in this direction has been reported in \cite{W92:munster}.
\end{remark}

\end{problem}
\end{document}
