An algorithm for unification modulo one-sided distributivity is an early result by Tiden and Arnborg [14]. Unfortunately the algorithm presented in the paper, although correct, has recently been shown not to be polynomial time bounded as claimed [11]. 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. © 2012 Springer-Verlag.
CITATION STYLE
Marshall, A. M., & Narendran, P. (2012). New algorithms for unification modulo one-sided distributivity and its variants. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7364 LNAI, pp. 408–422). https://doi.org/10.1007/978-3-642-31365-3_32
Mendeley helps you to discover research relevant for your work.