New Algorithms for Unification Modulo One-Sided Distributivity and Its Variants
An algorithm for unification modulo one-sided distributivity is an early result by Tiden and Arnborg . Unfortunately the algorithm presented in the paper, although correct, has recently been shown not to be polynomial time bounded as claimed . In addition, for some instances, there exist most general unifiers that are exponentially large with respect to the input size. In this paper we first present a new polynomial time algorithm that solves the decision problem for a non-trivial subcase, based on a typed theory, of unification modulo one-sided distributivity. Next we present a new polynomial algorithm that solves the decision problem for unification modulo one-sided distributivity. A construction, employing string compression, is used to achieve the polynomial bound.
KeywordsEquivalence Class Standard Form Inference Rule Sink Node Transitive Closure
Unable to display preview. Download preview PDF.
- 1.Baader, F., Nipkow, T.: Term rewriting and all that. Cambridge University Press, New York (1998)Google Scholar
- 2.Baader, F., Snyder, W.: Unification theory. In: Alan Robinson, J., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 445–532. Elsevier, MIT Press (2001)Google Scholar
- 4.Gascòn, A., Godoy, G., Schmidt-Schauß, M.: Unification and matching on compressed terms. ACM TOCL 12(4) (2011)Google Scholar
- 5.Jouannaud, J.-P., Kirchner, C.: Solving equations in abstract algebras: A rule-based survey of unification. In: Computational Logic - Essays in Honor of Alan Robinson, pp. 257–321 (1991)Google Scholar
- 9.Marshall, A.M., Narendran, P.: New algorithms for unification modulo one-sided distributivity and its variants. Technical Report SUNYA-CS-12-02, University at Albany-SUNY (2012), http://www.cs.albany.edu/~ncstrl/treports/Data/README.html
- 11.Narendran, P., Marshall, A.M., Mahapatra, B.: On the complexity of the Tiden-Arnborg algorithm for unification modulo one-sided distributivity. In: UNIF 24. EPTCS, vol. 42, pp. 54–63 (2010)Google Scholar