|
 REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
COHN, P.M. Universal Algebra. Harper and Row, New York, 1965.
|
 |
2
|
|
| |
3
|
EVANS, T. On multiphcatwe systems defined by generators and relaUons. I. Normal form theorems. Proc. Cambridge Phd. Soc 47 (1951), 637-649.
|
| |
4
|
HINDLEY, R. An abstract Church-Rosser theorem, ii Apphcattons. J Symbohc Logzc 39 (1974), 1-21.
|
| |
5
|
|
| |
6
|
HUET,G. Unification dans des langages d'ordre 1, 2 .... w These d'Etat, Universit6 Pans VI, 1976.
|
| |
7
|
|
| |
8
|
|
| |
9
|
KNUTH, D.E., AND BENDIX, P.B.Simple word problems in umversal algebras. In Computational Problems m Abstract Algebras, J Leech, Ed, Pergammon Press, 1970, pp. 263-297.
|
| |
10
|
LANKFORD, D S. Canomcal algebraic slmphficatlon m computaUonal logic Tech. Rep, Mathemaucs Dep, Unlv of Texas, Austin, Texas, May 1975
|
| |
11
|
LANKFORD, D S Canonical reference Tech. Rep., Mathemaucs Dep., Umv of Texas, Austin, Texas, Dec. 1975
|
| |
12
|
LANKFORD, D S A umficatlon algorithm for Abehan group theory Tech Rep., Mathematics Dep, Lomslana Tech Umv, Ruston, La, January 1979.
|
| |
13
|
LANKFORD, D.S On proving term rewriting systems are noethenan. Tech Pep., Mathematics Dep, Louisiana Tech Umv, Ruston, La., May 1979
|
| |
14
|
LANKFORD, D.S, AND BALLANTYNE, A.M. Decision procedures for simple equational theories wRh a commutative axiom. Complete sets of commutative reductions Tech Rep., Mathematics Dep., Univ. of Texas, Austin, Texas, March 1977
|
| |
15
|
LANK_FORD, D.S, AND BALLANTYNE, A M Decision procedures for simple equational theories with permutattve axioms: Complete sets of permutative reductions. Tech Rep, Mathematics Dep., Univ of Texas, Austin, Texas, April 1977
|
| |
16
|
LANKFORD, D S, AND BALLANTYNE, A.M.Decision procedures for simple equational theories with commutatwe-associative axioms. Complete sets of commutative-associative reductions. Tech. Rep, Mathematics Dep., Umv. of Texas, Austin, Texas, Aug 1977
|
| |
17
|
LIVESEY, M., AND SIEKMANN, J Termination and decidability results for string-unification Memo CSM-12, Essex Univ. Computing Center, Colchester, Essex, England, Aug. 1975.
|
| |
18
|
LIVESEY, M, AND SIEKMANN, J.Umficatlon of A+C-terms (bags) and A+C+l-terms (sets) Interner Bencht Nr 5/76, lnstitut fur Informatik I, Umversltat Karlsruhe, Karlsruhe, W. Germany, 1976
|
| |
19
|
|
| |
20
|
NEWMAN, M.H.A On theories w~th a combinatorial defmmon of "equivalence." Ann. Math 43 (1942), 223-243.
|
| |
21
|
PLOTKIN, G.D.Buddmg-m equational theories. Machine intelhgence 7, B. Meltzer and D Mlchle, Eds., Halsted Press, 1972, pp. 73-90.
|
| |
22
|
QUINE, W.V.The problem of stmphfymg truth funcnons Am. Math Monthly 59, 8 (Oct. 1952), 521-531
|
| |
23
|
|
| |
24
|
|
| |
25
|
|
| |
26
|
SIEKMANN, J Stnng-umfication, part I Essex University, Colchester, Essex, England, March 1975
|
| |
27
|
SIEKMANN,T-umficatton, part i Umficatton of commutative terms. Interner Bencht Nr 4/76, Instttut fur Informatik I, Umvers~tat Karlsruhe, Karlsruhe, W Germany, 1976
|
| |
28
|
|
| |
29
|
STICK.EL, M.E. A complete umficatlon algorithm for associative-commutative funct,ons. Advance Papers 4th Int. Jomt Conf on Amficlal Intelhgence, Tbihsi, U.S.S.R., 1975, pp. 71-76 To appear in J ACM.
|
| |
30
|
|
| |
31
|
MAKANIN, G.S.The problem of solvability of equations in a free semigroup. Soviet Akad. Nauk SSSR 233, 2 (1977).
|
CITED BY 41
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Nachum Dershowitz , Jien Hsiang , N. Alan Josephson , David A. Plaisted, Associative-commutative rewriting, Proceedings of the Eighth international joint conference on Artificial intelligence, p.940-944, August 08-12, 1983, Karlsruhe, West Germany
|
|
|
K. Blasius , N. Fisinger , J. Siekmann , G. Smolka , A. Herold , C. Walther, The Markgraf Karl refutation procedure, Proceedings of the 7th international joint conference on Artificial intelligence, p.511-518, August 24-28, 1981, Vancouver, BC, Canada
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Adobe Acrobat
QuickTime
Windows Media Player
Real Player
Pdf
G.2