学术探索
学术期刊
新闻热点
数据分析
智能评审
立即登录
HISTORY AND BASIC FEATURES OF THE CRITICAL-PAIR COMPLETION PROCEDURE
被引:37
作者
:
BUCHBERGER, B
论文数:
0
引用数:
0
h-index:
0
BUCHBERGER, B
机构
:
来源
:
JOURNAL OF SYMBOLIC COMPUTATION
|
1987年
/ 3卷
/ 1-2期
关键词
:
D O I
:
10.1016/S0747-7171(87)80020-2
中图分类号
:
TP301 [理论、方法];
学科分类号
:
081202 ;
摘要
:
引用
收藏
页码:3 / 38
页数:36
相关论文
共 249 条
[31]
The question of endless work in the theory of polynomials
[J].
Hermann, G
论文数:
0
引用数:
0
h-index:
0
Hermann, G
.
MATHEMATISCHE ANNALEN,
1926,
95
:736
-788
[32]
AN ABSTRACT FORM OF CHURCH-ROSSER THEOREM .1.
[J].
HINDLEY, R
论文数:
0
引用数:
0
h-index:
0
HINDLEY, R
.
JOURNAL OF SYMBOLIC LOGIC,
1969,
34
(04)
:545
-&
[33]
ABSTRACT CHURCH-ROSSER THEOREM .2. APPLICATIONS
[J].
HINDLEY, R
论文数:
0
引用数:
0
h-index:
0
机构:
UNIV COLL SWANSEA,SWANSEA SA2 8PP,WALES
UNIV COLL SWANSEA,SWANSEA SA2 8PP,WALES
HINDLEY, R
.
JOURNAL OF SYMBOLIC LOGIC,
1974,
39
(01)
:1
-21
[34]
RESOLUTION SINGULARITIES OF ALGEBRAIC VARIETY OVER FIELD OF CHARACTERISTIC ZERO .I.
[J].
HIRONAKA, H
论文数:
0
引用数:
0
h-index:
0
HIRONAKA, H
.
ANNALS OF MATHEMATICS,
1964,
79
(01)
:109
-&
[35]
REWRITE METHOD FOR THEOREM-PROVING IN 1ST ORDER THEORY WITH EQUALITY
[J].
HSIANG, J
论文数:
0
引用数:
0
h-index:
0
HSIANG, J
.
JOURNAL OF SYMBOLIC COMPUTATION,
1987,
3
(1-2)
:133
-151
[36]
PROOFS BY INDUCTION IN EQUATIONAL THEORIES WITH CONSTRUCTORS
[J].
HUET, G
论文数:
0
引用数:
0
h-index:
0
HUET, G
;
HULLOT, JM
论文数:
0
引用数:
0
h-index:
0
HULLOT, JM
.
JOURNAL OF COMPUTER AND SYSTEM SCIENCES,
1982,
25
(02)
:239
-266
[37]
Huet G., 1980, 21st Annual Symposium on Foundations of Computer Science, P96, DOI 10.1109/SFCS.1980.37
[38]
ALGORITHM TO GENERATE BASIS OF SOLUTIONS TO HOMOGENEOUS LINEAR DIOPHANTINE EQUATIONS
[J].
HUET, G
论文数:
0
引用数:
0
h-index:
0
HUET, G
.
INFORMATION PROCESSING LETTERS,
1978,
7
(03)
:144
-147
[39]
A COMPLETE PROOF OF CORRECTNESS OF THE KNUTH-BENDIX COMPLETION ALGORITHM
[J].
HUET, G
论文数:
0
引用数:
0
h-index:
0
HUET, G
.
JOURNAL OF COMPUTER AND SYSTEM SCIENCES,
1981,
23
(01)
:11
-21
[40]
CONFLUENT REDUCTIONS - ABSTRACT PROPERTIES AND APPLICATIONS TO TERM REWRITING SYSTEMS
[J].
HUET, G
论文数:
0
引用数:
0
h-index:
0
HUET, G
.
JOURNAL OF THE ACM,
1980,
27
(04)
:797
-821
←
1
2
3
4
5
6
7
8
9
10
→
共 249 条
[31]
The question of endless work in the theory of polynomials
[J].
Hermann, G
论文数:
0
引用数:
0
h-index:
0
Hermann, G
.
MATHEMATISCHE ANNALEN,
1926,
95
:736
-788
[32]
AN ABSTRACT FORM OF CHURCH-ROSSER THEOREM .1.
[J].
HINDLEY, R
论文数:
0
引用数:
0
h-index:
0
HINDLEY, R
.
JOURNAL OF SYMBOLIC LOGIC,
1969,
34
(04)
:545
-&
[33]
ABSTRACT CHURCH-ROSSER THEOREM .2. APPLICATIONS
[J].
HINDLEY, R
论文数:
0
引用数:
0
h-index:
0
机构:
UNIV COLL SWANSEA,SWANSEA SA2 8PP,WALES
UNIV COLL SWANSEA,SWANSEA SA2 8PP,WALES
HINDLEY, R
.
JOURNAL OF SYMBOLIC LOGIC,
1974,
39
(01)
:1
-21
[34]
RESOLUTION SINGULARITIES OF ALGEBRAIC VARIETY OVER FIELD OF CHARACTERISTIC ZERO .I.
[J].
HIRONAKA, H
论文数:
0
引用数:
0
h-index:
0
HIRONAKA, H
.
ANNALS OF MATHEMATICS,
1964,
79
(01)
:109
-&
[35]
REWRITE METHOD FOR THEOREM-PROVING IN 1ST ORDER THEORY WITH EQUALITY
[J].
HSIANG, J
论文数:
0
引用数:
0
h-index:
0
HSIANG, J
.
JOURNAL OF SYMBOLIC COMPUTATION,
1987,
3
(1-2)
:133
-151
[36]
PROOFS BY INDUCTION IN EQUATIONAL THEORIES WITH CONSTRUCTORS
[J].
HUET, G
论文数:
0
引用数:
0
h-index:
0
HUET, G
;
HULLOT, JM
论文数:
0
引用数:
0
h-index:
0
HULLOT, JM
.
JOURNAL OF COMPUTER AND SYSTEM SCIENCES,
1982,
25
(02)
:239
-266
[37]
Huet G., 1980, 21st Annual Symposium on Foundations of Computer Science, P96, DOI 10.1109/SFCS.1980.37
[38]
ALGORITHM TO GENERATE BASIS OF SOLUTIONS TO HOMOGENEOUS LINEAR DIOPHANTINE EQUATIONS
[J].
HUET, G
论文数:
0
引用数:
0
h-index:
0
HUET, G
.
INFORMATION PROCESSING LETTERS,
1978,
7
(03)
:144
-147
[39]
A COMPLETE PROOF OF CORRECTNESS OF THE KNUTH-BENDIX COMPLETION ALGORITHM
[J].
HUET, G
论文数:
0
引用数:
0
h-index:
0
HUET, G
.
JOURNAL OF COMPUTER AND SYSTEM SCIENCES,
1981,
23
(01)
:11
-21
[40]
CONFLUENT REDUCTIONS - ABSTRACT PROPERTIES AND APPLICATIONS TO TERM REWRITING SYSTEMS
[J].
HUET, G
论文数:
0
引用数:
0
h-index:
0
HUET, G
.
JOURNAL OF THE ACM,
1980,
27
(04)
:797
-821
←
1
2
3
4
5
6
7
8
9
10
→