Some Independent Results for Equational Unification
暂无分享,去创建一个
[1] William M. Farmer,et al. A unification algorithm for second-order monadic terms , 1988, Ann. Pure Appl. Log..
[2] Klaus U. Schulz,et al. Makanin's Algorithm for Word Equations - Two Improvements and a Generalization , 1990, IWWERT.
[3] Jan van Leeuwen,et al. Formal models and semantics , 1990 .
[4] Friedrich Otto,et al. String-Rewriting Systems , 1993, Text and Monographs in Computer Science.
[5] G. Makanin. The Problem of Solvability of Equations in a Free Semigroup , 1977 .
[6] Jean-Pierre Jouannaud,et al. Rewrite Systems , 1991, Handbook of Theoretical Computer Science, Volume B: Formal Models and Sematics.
[7] Friedrich Otto,et al. On two problems related to cancellativity , 1986 .
[8] J. Van Leeuwen,et al. Handbook of theoretical computer science - Part A: Algorithms and complexity; Part B: Formal models and semantics , 1990 .
[9] Dov M. Gabbay,et al. Handbook of logic in artificial intelligence and logic programming (vol. 1) , 1993 .
[10] Hans-Jürgen Bürckert. Matching - A Special Case of Unification? , 1989, J. Symb. Comput..
[11] Franz Baader,et al. Unification theory , 1986, Decis. Support Syst..
[12] Paliath Narendran,et al. Some Results on Equational Unification , 1990, CADE.
[13] Friedrich Otto. Solvability of Word Equations Modulo Finite Special and Confluent String-Rewriting Systems is Undecidable in General , 1995, Inf. Process. Lett..
[14] Klaus U. Schulz. Word Equations and Related Topics , 1990, Lecture Notes in Computer Science.
[15] Warren D. Goldfarb,et al. The Undecidability of the Second-Order Unification Problem , 1981, Theor. Comput. Sci..