Abstract
A clear distinction is made between the (elementary) unification problem where there is only one pair of terms to be unified, and the simultaneous unification problem, where many such pairs have to be unified simultaneously – it is shown that there exists a finite, depth-reducing, linear, and confluent term-rewriting system R such that the (single) equational unification problem mod R is decidable, while the simultaneous equational unification problem mod R is undecidable. Also a finite set E of variable-permuting equations is constructed such that equational unification is undecidable mod E, thus settling an open problem. The equational matching problem for variable-permuting theories is shown to be PSPACE-complete.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Baader, F. and Siekmann, J.: Unification theory, in: D.M. Gabbay, C. J. Hogger and J. A. Robinson (eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, Oxford University Press, Oxford, UK, 1993.
Bauer, G. and Otto, F.: Finite complete rewriting systems and the complexity of the word problem, Acta Informatica 21(1984), 521–540.
Benanav, D., Kapur, D., and Narendran, P.: Complexity of matching problems, J. Symbolic Computation 3(1987), 203–216.
Bockmayr, A.: A note on a canonical theory with undecidable unification and matching problem, J. Automated Reasoning 3(1987), 379–381.
Book, R. V. and Otto, F.: String-Rewriting Systems, Springer, New York, 1993.
Book, R. V., Jantzen, M., Monien, B., Ó’DúAnlaing, C., and Wrathall, C.: On the complexity of word problems in certain Thue systems, in: J. Gruska and M. Chytil (eds.), Mathematical Foundations of Computer Science, Lecture Notes in Computer Science 118(Springer, Berlin, 1981), pp. 216–223.
Bürckert, H.-J., Herold, A., and Schmidt-Schauss, M.: On equational theories, unification, and (un)decidability, J. Symbolic Computation 8(1989), 3–49.
Dershowitz, N. and Jouannaud, J. P.: Rewrite systems, in: J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics, Elsevier, Amsterdam, 1990, pp. 243–320.
Fages, F.: Associative-commutative unification, J. Symbolic Computation 3(1987), 257–275.
Fortenbacher, A.: An algebraic approach to unification under associativity and commutativity, J. Symbolic Computation 3(1987), 217–229.
Heilbrunner, S. and Hölldobler, S.: The undecidability of the unification and matching problem for canonical theories, Acta Informatica 24(1987), 157–171.
Hopcroft, J. E. and Ullman, J. D.: Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA, 1979.
Huet, G. and Oppen, D.: Equations and rewrite rules: A survey, in: R. V. Book (ed.), Formal Languages: Perspectives and Open Problems, Academic Press, New York, 1980, pp. 349–405.
Otto, F.: On two problems related to cancellativity, Semigroup Forum 33(1986), 331–356.
Paterson, M. and Wegman, M.: Linear unification, J. Computer System Sci. 16(1978), 158–167.
Robinson, J. A.: A machine oriented logic based on the resolution principle, J. Computing Machinery 12(1965), 23–41.
Schmidt-Schauss, M. J.: Two problems in unification theory, Bull. EATCS 34(Feb. ’88), 273.
Schmidt-Schauss, M. J.: Unification in permutative equational theories is undecidable, J. Symbolic Computation 8(1989), 415–421.
Siekmann, J. H.: An introduction to unification theory, in R. B. Banerji (ed.), Formal Techniques in Artificial Intelligence, North-Holland, Amsterdam, 1990, pp. 369–424.
Stickel, M. E.:A unification algorithm for associative-commutative functions, J. ACM 28 (1981), 423–434.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Narendran, P., Otto, F. Single Versus Simultaneous Equational Unification and Equational Unification for Variable-Permuting Theories. Journal of Automated Reasoning 19, 87–115 (1997). https://doi.org/10.1023/A:1005764526878
Issue Date:
DOI: https://doi.org/10.1023/A:1005764526878