COMPLETION FOR REWRITING MODULO A CONGRUENCE

被引：38

作者：

BACHMAIR, L ^{[1
]}

DERSHOWITZ, N ^{[1
]}

机构：

[1] UNIV ILLINOIS,DEPT COMP SCI,URBANA,IL 61801

来源：

THEORETICAL COMPUTER SCIENCE | 1989年 / 67卷 / 2-3期

关键词：

D O I：

10.1016/0304-3975(89)90003-0

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

收藏

页码：173 / 201

页数：29

相关论文

共 29 条

[1] Bachmair L., 1986, Proceedings of the Symposium on Logic in Computer Science (Cat. No.86CH2321-8), P346
[2] CRITICAL PAIR CRITERIA FOR COMPLETION
BACHMAIR, L
DERSHOWITZ, N
[J]. JOURNAL OF SYMBOLIC COMPUTATION, 1988, 6 (01) : 1 - 18
[3] TERMINATION ORDERINGS FOR ASSOCIATIVE-COMMUTATIVE REWRITING-SYSTEMS
BACHMAIR, L
PLAISTED, DA
[J]. JOURNAL OF SYMBOLIC COMPUTATION, 1985, 1 (04) : 329 - 349
[4] BACHMAIR L, 1987, THESIS U ILLINOIS UR
[5] TERMINATION OF REWRITING-SYSTEMS BY POLYNOMIAL INTERPRETATIONS AND ITS IMPLEMENTATION
BENCHERIFA, A
LESCANNE, P
[J]. SCIENCE OF COMPUTER PROGRAMMING, 1987, 9 (02) : 137 - 159
[6] PROVING TERMINATION WITH MULTI-SET ORDERINGS
DERSHOWITZ, N
MANNA, Z
[J]. COMMUNICATIONS OF THE ACM, 1979, 22 (08) : 465 - 476
[7] COMPLETE-SETS OF UNIFIERS AND MATCHERS IN EQUATIONAL THEORIES
FAGES, F
HUET, G
[J]. THEORETICAL COMPUTER SCIENCE, 1986, 43 (2-3) : 189 - 200
[8] FAGES F, 1984, LECT NOTES COMPUT SC, V170, P194
[9] GALLIER JH, 1987, LECT NOTES COMPUT SC, V256, P216
[10] REFUTATIONAL THEOREM-PROVING USING TERM-REWRITING SYSTEMS
HSIANG, J
[J]. ARTIFICIAL INTELLIGENCE, 1985, 25 (03) : 255 - 300