CRITICAL PAIR CRITERIA FOR COMPLETION

被引：33

作者：

BACHMAIR, L ^{[1
]}

DERSHOWITZ, N ^{[1
]}

机构：

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

来源：

关键词：

D O I：

10.1016/S0747-7171(88)80018-X

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：1 / 18

页数：18

共 29 条

[1]

Bachmair L., 1986, Proceedings of the Symposium on Logic in Computer Science (Cat. No.86CH2321-8), P346

[2]

BACHMAIR L, 1987, THESIS U ILLINOIS UR

[3]

BACHMAIR L, 1987, IN PRESS P EUROCAL 8

[4]

BACHMAIR L, 1987, SPRINGER LEC NOTES C, V256, P192

[5]

BUCHBERGER B, 1984, LECT NOTES COMPUT SC, V171, P137

[6] PROVING TERMINATION WITH MULTI-SET ORDERINGS [J].

DERSHOWITZ, N ;

MANNA, Z .

[7]

DERSHOWITZ N, 1987, IN PRESS SIAM J COMP

[8]

DERSHOWITZ N, 1985, INFORM CONTR, V64, P122

[9]

Fribourg L., 1985, 1985 Symposium on Logic Programming (Cat. No.85CH2205-3), P172

[10] REFUTATIONAL THEOREM-PROVING USING TERM-REWRITING SYSTEMS [J].

HSIANG, J .