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 条

[21] AUTOMATING THE KNUTH BENDIX ORDERING
DICK, J
KALMUS, J
MARTIN, U
ACTA INFORMATICA, 1990, 28 (02) : 95 - 119
[22] INDUCTIVE INFERENCE FOR SOLVING DIVERGENCE IN KNUTH-BENDIX COMPLETION
THOMAS, M
JANTKE, KP
ANALOGICAL AND INDUCTIVE INFERENCE /, 1989, 397 : 288 - 303
[23] A COMPLETE PROOF OF CORRECTNESS OF THE KNUTH-BENDIX COMPLETION ALGORITHM
HUET, G
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1981, 23 (01) : 11 - 21
[24] SLOTHROP: Knuth-Bendix completion with a modern termination checker
Wehrman, Ian
Stump, Aaron
Westbrook, Edwin
TERM REWRITING AND APPLICATIONS, PROCEEDINGS, 2006, 4098 : 287 - 296
[25] A Formalization of the Knuth-Bendix(-Huet) Critical Pair Theorem
Galdino, Andre L.
Ayala-Rincon, Mauricio
JOURNAL OF AUTOMATED REASONING, 2010, 45 (03) : 301 - 325
[26] Paramodulation and Knuth-Bendix completion with nontotal and nonmonotonic orderings
Bofill, M
Godoy, G
Nieuwenhuis, R
Rubio, A
JOURNAL OF AUTOMATED REASONING, 2003, 30 (01) : 99 - 120
[27] Knuth-Bendix constraint solving is NP-complete
Korovin, K
Voronkov, A
AUTOMATA LANGUAGES AND PROGRAMMING, PROCEEDING, 2001, 2076 : 979 - 992
[28] SOLVING DIVERGENCE IN KNUTH-BENDIX COMPLETION BY ENRICHING SIGNATURES
THOMAS, M
WATSON, P
THEORETICAL COMPUTER SCIENCE, 1993, 112 (01) : 145 - 185
[29] An upper bound on the derivational complexity of Knuth-Bendix orderings
Hofbauer, D
INFORMATION AND COMPUTATION, 2003, 183 (01) : 43 - 56
[30] Abstract Reduction Systems and Idea of Knuth-Bendix Completion Algorithm
Bancerek, Grzegorz
FORMALIZED MATHEMATICS, 2014, 22 (01): : 37 - 56

← 1 2 3 4 5 →