HISTORY AND BASIC FEATURES OF THE CRITICAL-PAIR COMPLETION PROCEDURE

被引:37
作者
BUCHBERGER, B
机构
关键词
D O I
10.1016/S0747-7171(87)80020-2
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
引用
收藏
页码:3 / 38
页数:36
相关论文
共 249 条
[1]  
AHO AV, 1972, DESIGN OPTIMIZATION, P89
[2]  
[Anonymous], SYMBOLIC LOGIC MECHA
[3]  
[Anonymous], 1976, THESIS U PARIS 7
[4]   TERMINATION ORDERINGS FOR ASSOCIATIVE-COMMUTATIVE REWRITING-SYSTEMS [J].
BACHMAIR, L ;
PLAISTED, DA .
JOURNAL OF SYMBOLIC COMPUTATION, 1985, 1 (04) :329-349
[5]   NEW DECISION ALGORITHMS FOR FINITELY PRESENTED COMMUTATIVE SEMIGROUPS [J].
BALLANTYNE, AM ;
LANKFORD, DS .
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1981, 7 (02) :159-165
[6]  
BAYER D, 1982, THESIS HARVARD U CAM
[7]   DIAMOND LEMMA FOR RING THEORY [J].
BERGMAN, GM .
ADVANCES IN MATHEMATICS, 1978, 29 (02) :178-218
[8]   THUE SYSTEMS AS REWRITING-SYSTEMS [J].
BOOK, RV .
JOURNAL OF SYMBOLIC COMPUTATION, 1987, 3 (1-2) :39-68
[9]   CONFLUENT AND OTHER TYPES OF THUE SYSTEMS [J].
BOOK, RV .
JOURNAL OF THE ACM, 1982, 29 (01) :171-182
[10]  
Buchberger B., 1982, Computing (Supplementum), P11