论文信息 - Some Independence Results for Equational Uniication

Some Independence Results for Equational Uniication

For nite convergent term-rewriting systems the equational uniication problem is shown to be recursively independent of the equa-tional matching problem, the word matching problem, and the (simultaneous) 2 nd-order equational matching problem. We also present some new decidability results for simultaneous equational uniication and 2 nd-order equational matching.

Paliath Narendran | Daniel J. Dougherty

[1] William M. Farmer,et al. A unification algorithm for second-order monadic terms , 1988, Ann. Pure Appl. Log..

[2] Hans-Jürgen Bürckert. Matching - A Special Case of Unification? , 1989, J. Symb. Comput..

[3] Klaus U. Schulz,et al. Makanin's Algorithm for Word Equations - Two Improvements and a Generalization , 1990, IWWERT.

[4] Friedrich Otto. Solvability of Word Equations Modulo Finite Special and Confluent String-Rewriting Systems is Undecidable in General , 1995, Inf. Process. Lett..

[5] Friedrich Otto,et al. On two problems related to cancellativity , 1986 .

[6] Paliath Narendran,et al. Some Results on Equational Unification , 1990, CADE.

[7] Friedrich Otto,et al. String-Rewriting Systems , 1993, Text and Monographs in Computer Science.

[8] Warren D. Goldfarb,et al. The Undecidability of the Second-Order Unification Problem , 1981, Theor. Comput. Sci..

[9] G. Makanin. The Problem of Solvability of Equations in a Free Semigroup , 1977 .