On the Complexity of the Tiden-Arnborg Algorithm for Unification modulo One-Sided Distributivity

Abstract

We prove that the Tiden and Arnborg algorithm for equational unification modulo one-sided distributivity is not polynomial time bounded as previously thought. A set of counterexamples is developed that demonstrates that the algorithm goes through exponentially many steps.