HOW TO CHOOSE THE WEIGHTS IN THE KNUTH-BENDIX ORDERING

被引：0

|

作者：

MARTIN, U

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1987年 / 256卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：42 / 53

页数：12

相关论文

共 50 条

[41] THE WORD PROBLEM FOR GROUPS WITH REGULAR RELATIONS - IMPROVEMENT OF THE KNUTH-BENDIX ALGORITHM
HAYASHI, C
PUBLICATIONS OF THE RESEARCH INSTITUTE FOR MATHEMATICAL SCIENCES, 1992, 28 (06) : 913 - 942
[42] ONLY PRIME SUPERPOSITIONS NEED BE CONSIDERED IN THE KNUTH-BENDIX COMPLETION PROCEDURE
KAPUR, D
MUSSER, DR
NARENDRAN, P
JOURNAL OF SYMBOLIC COMPUTATION, 1988, 6 (01) : 19 - 36
[43] COMPLETE EQUATIONAL UNIFICATION BASED ON AN EXTENSION OF THE KNUTH-BENDIX COMPLETION PROCEDURE
OHSUGA, A
SAKAI, K
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 572 : 197 - 209
[44] THE USE OF KNUTH-BENDIX METHODS TO SOLVE THE WORD PROBLEM IN AUTOMATIC GROUPS
EPSTEIN, DBA
HOLT, DF
REES, SE
JOURNAL OF SYMBOLIC COMPUTATION, 1991, 12 (4-5) : 397 - 414
[45] TOWARDS A SET OF INFERENCE RULES FOR SOLVING DIVERGENCE IN KNUTH-BENDIX COMPLETION
LANGE, S
ANALOGICAL AND INDUCTIVE INFERENCE /, 1989, 397 : 304 - 316
[46] IT IS UNDECIDABLE WHETHER THE KNUTH-BENDIX COMPLETION PROCEDURE GENERATES A CROSSED PAIR
NARENDRAN, P
STILLMAN, J
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 349 : 348 - 359
[47] Faster Log Analysis and Integration of Security Incidents Using Knuth-Bendix Completion
Ando, Ruo
Miwa, Shinsuke
NEURAL INFORMATION PROCESSING, PT II, 2011, 7063 : 28 - 36
[48] ABOUT THE REWRITING-SYSTEMS PRODUCED BY THE KNUTH-BENDIX COMPLETION ALGORITHM
METIVIER, Y
INFORMATION PROCESSING LETTERS, 1983, 16 (01) : 31 - 34
[49] REDUCING THE COMPLEXITY OF THE KNUTH-BENDIX COMPLETION ALGORITHM - A UNIFICATION OF DIFFERENT APPROACHES
WINKLER, F
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 204 : 378 - 389
[50] KNUTH-BENDIX COMPLETION OF HORN CLAUSE PROGRAMS FOR RESTRICTED LINEAR RESOLUTION AND PARAMODULATION
BERTLING, H
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 516 : 181 - 193

← 1 2 3 4 5 →