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

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

2010-12-22

arxiv.org/abs/1012.4894v1

EPTCS 42, 2010, pp. 54-63

Computer Science

Symbolic Computation

In Proceedings UNIF 2010, arXiv:1012.4554

Scientific paper

10.4204/EPTCS.42.5

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.

Affiliated with

Also associated with

No associations

Rating

On the Complexity of the Tiden-Arnborg Algorithm for Unification modulo One-Sided Distributivity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Complexity of the Tiden-Arnborg Algorithm for Unification modulo One-Sided Distributivity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Complexity of the Tiden-Arnborg Algorithm for Unification modulo One-Sided Distributivity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-581932