Decision Problems in Ordered Rewriting

A term rewrite system (TRS) terminates ii its rules are contained in a reduction ordering >. In order to deal with any set of equations, including inherently non-terminating ones (like commutativity), TRS have been generalised to ordered TRS (E; >), where equations of E are applied in whatever direction agrees with >. The connuence of terminating TRS is well-known to be decidable, but for ordered TRS the decidability of connuence has been open. Here we show that the connuence of ordered TRS is decidable if ordering constraints for > can be solved in an adequate way, which holds in particular for the class of LPO orderings. For sets E of constrained equations, connuence is shown to be undecidable. Finally, ground reducibility is proved undecidable for ordered TRS.