THE KNUTH-BENDIX COMPLETION PROCEDURE AND THUE SYSTEMS

被引：32

|

作者：

KAPUR, D

NARENDRAN, P

机构：

来源：

SIAM JOURNAL ON COMPUTING | 1985年 / 14卷 / 04期

关键词：

D O I：

10.1137/0214073

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

收藏

页码：1052 / 1072

页数：21

相关论文

共 50 条

[41] Knuth-Bendix constraint solving is NP-complete
Korovin, K
Voronkov, A
[J]. AUTOMATA LANGUAGES AND PROGRAMMING, PROCEEDING, 2001, 2076 : 979 - 992
[42] An upper bound on the derivational complexity of Knuth-Bendix orderings
Hofbauer, D
[J]. INFORMATION AND COMPUTATION, 2003, 183 (01) : 43 - 56
[43] Derivation lengths and order types of Knuth-Bendix orders
Lepper, I
[J]. THEORETICAL COMPUTER SCIENCE, 2001, 269 (1-2) : 433 - 450
[44] A SIMPLE NON-TERMINATION TEST FOR THE KNUTH-BENDIX METHOD
PLAISTED, DA
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1986, 230 : 79 - 88
[45] Characterising Space Complexity Classes via Knuth-Bendix Orders
Bonfante, Guillaume
Moser, Georg
[J]. LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, 2010, 6397 : 142 - +
[46] Knuth－Bendix过程的发散现象的研究
陈意云
[J]. 计算机学报, 1994, (06) : 464 - 468
[47] The decidability of the first-order theory of Knuth-Bendix order
Zhang, T
Sipma, HB
Manna, Z
[J]. AUTOMATED DEDUCTION - CADE-20, PROCEEDINGS, 2005, 3632 : 131 - 148
[48] An extension of the Knuth-Bendix ordering with LPO-like properties
Ludwig, Michel
Waldmann, Uwe
[J]. LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, PROCEEDINGS, 2007, 4790 : 348 - +
[49] TERM REWRITING-SYSTEMS - FROM CHURCH-ROSSER TO KNUTH-BENDIX AND BEYOND
KLOP, JW
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1990, 443 : 350 - 369
[50] THE WORD PROBLEM FOR GROUPS WITH REGULAR RELATIONS - IMPROVEMENT OF THE KNUTH-BENDIX ALGORITHM
HAYASHI, C
[J]. PUBLICATIONS OF THE RESEARCH INSTITUTE FOR MATHEMATICAL SCIENCES, 1992, 28 (06) : 913 - 942

← 1 2 3 4 5 →