Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baader, F., Nipkow, T.: Term rewriting and all that. Cambridge University Press, New York (1998)
Baader, F., Snyder, W.: Unification theory. In: Alan Robinson, J., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 445–532. Elsevier, MIT Press (2001)
Gascón, A., Godoy, G., Schmidt-Schauß, M.: Unification with Singleton Tree Grammars. In: Treinen, R. (ed.) RTA 2009. LNCS, vol. 5595, pp. 365–379. Springer, Heidelberg (2009)
Gascòn, A., Godoy, G., Schmidt-Schauß, M.: Unification and matching on compressed terms. ACM TOCL 12(4) (2011)
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)
Levy, J., Schmidt-Schauß, M., Villaret, M.: Monadic Second-Order Unification Is NP-Complete. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol. 3091, pp. 55–69. Springer, Heidelberg (2004)
Levy, J., Schmidt-Schauß, M., Villaret, M.: The complexity of monadic second-order unification. SIAM J. Computation 38(3), 1113–1140 (2008)
Lifshits, Y.: Processing Compressed Texts: A Tractability Border. In: Ma, B., Zhang, K. (eds.) CPM 2007. LNCS, vol. 4580, pp. 228–240. Springer, Heidelberg (2007)
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
Miyazaki, M., Shinohara, A., Takeda, M.: An Improved Pattern Matching Algorithm for Strings in Terms of Straight-line Programs. In: Hein, J., Apostolico, A. (eds.) CPM 1997. LNCS, vol. 1264, pp. 1–11. Springer, Heidelberg (1997)
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)
Plandowski, W.: Testing Equivalence of Morphisms on Context-free Languages. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol. 855, pp. 460–470. Springer, Heidelberg (1994)
Rytter, W.: Application of Lempel-Ziv factorization to the approximation of grammar-based compression. Theoretical Computer Science 302, 211–222 (2003)
Tidén, E., Arnborg, S.: Unification problems with one-sided distributivity. J. Symb. Comput. 3(1/2), 183–202 (1987)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Marshall, A.M., Narendran, P. (2012). New Algorithms for Unification Modulo One-Sided Distributivity and Its Variants. In: Gramlich, B., Miller, D., Sattler, U. (eds) Automated Reasoning. IJCAR 2012. Lecture Notes in Computer Science(), vol 7364. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31365-3_32
Download citation
DOI: https://doi.org/10.1007/978-3-642-31365-3_32
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31364-6
Online ISBN: 978-3-642-31365-3
eBook Packages: Computer ScienceComputer Science (R0)