ONLY PRIME SUPERPOSITIONS NEED BE CONSIDERED IN THE KNUTH-BENDIX COMPLETION PROCEDURE

被引：24

|

作者：

KAPUR, D

MUSSER, DR

NARENDRAN, P

机构：

来源：

JOURNAL OF SYMBOLIC COMPUTATION | 1988年 / 6卷 / 01期

关键词：

D O I：

10.1016/S0747-7171(88)80019-1

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

收藏

页码：19 / 36

页数：18

相关论文

共 27 条

[21] A higher-order Knuth-Bendix procedure and its applications
Kusakari, Keiichirou
Chiba, Yuki
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2007, E90D (04) : 707 - 715
[22] ABOUT THE REWRITING-SYSTEMS PRODUCED BY THE KNUTH-BENDIX COMPLETION ALGORITHM
METIVIER, Y
INFORMATION PROCESSING LETTERS, 1983, 16 (01) : 31 - 34
[23] 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
[24] 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
[25] KNUTH-BENDIX COMPLETION OF HORN CLAUSE PROGRAMS FOR RESTRICTED LINEAR RESOLUTION AND PARAMODULATION
BERTLING, H
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 516 : 181 - 193
[26] A decision procedure for the existential theory of term algebras with the Knuth-Bendix ordering
Korovin, K
Voronkov, A
15TH ANNUAL IEEE SYMPOSIUM ON LOGIC IN COMPUTER SCIENCE, PROCEEDINGS, 2000, : 291 - 302
[27] THE KNUTH-BENDIX COMPLETION ALGORITHM, AUTOMATA, AND THE GROWTH-FUNCTION IN GROUP-THEORY
RICHTER, MM
JOURNAL OF SYMBOLIC LOGIC, 1987, 52 (04) : 1060 - 1060