\documentclass{rtaloop}


\begin{document}
\begin{problem}{Aart Middeldorp}{}{April 1991}

\begin{abstract}
Is the decidability of strong sequentiality for orthogonal term
rewriting systems NP-complete?
\end{abstract}

Is the decidability of strong sequentiality for orthogonal term
rewriting systems NP-complete?
See \cite{HL91:mit,KM91}.
\nocite{HL79:inria}

\end{problem}
\end{document}
