PROVING TERMINATION OF ASSOCIATIVE COMMUTATIVE REWRITING-SYSTEMS BY REWRITING

被引：0

|

作者：

GNAEDIG, I

LESCANNE, P

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1986年 / 230卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：52 / 61

页数：10

相关论文

共 50 条

[1] TERMINATION ORDERINGS FOR ASSOCIATIVE-COMMUTATIVE REWRITING-SYSTEMS
BACHMAIR, L
PLAISTED, DA
[J]. JOURNAL OF SYMBOLIC COMPUTATION, 1985, 1 (04) : 329 - 349
[2] PROVING TERMINATION FOR TERM REWRITING-SYSTEMS
WEIERMANN, A
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1992, 626 : 419 - 428
[3] ON PROVING UNIFORM TERMINATION AND RESTRICTED TERMINATION OF REWRITING-SYSTEMS
GUTTAG, JV
KAPUR, D
MUSSER, DR
[J]. SIAM JOURNAL ON COMPUTING, 1983, 12 (01) : 189 - 214
[4] A PATH ORDERING FOR PROVING TERMINATION OF TERM REWRITING-SYSTEMS
KAPUR, D
NARENDRAN, P
SIVAKUMAR, G
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1985, 185 : 173 - 187
[5] Proving termination of ω rewriting systems
Shigeta, Y
Akama, K
Koike, H
Ishikawa, T
[J]. INTERNATIONAL CONFERENCE ON COMPUTING AND INFORMATION TECHNOLOGIES : EXPLORING EMERGING TECHNOLOGIES, 2001, : 399 - 404
[6] ON THE MODULARITY OF TERMINATION OF TERM REWRITING-SYSTEMS
OHLEBUSCH, E
[J]. THEORETICAL COMPUTER SCIENCE, 1994, 136 (02) : 333 - 360
[7] MODULAR TERM REWRITING-SYSTEMS AND THE TERMINATION
KURIHARA, M
KAJI, I
[J]. INFORMATION PROCESSING LETTERS, 1990, 34 (01) : 1 - 4
[8] A LOCAL TERMINATION PROPERTY FOR TERM REWRITING-SYSTEMS
LATCH, DM
SIGAL, R
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1989, 355 : 222 - 233
[9] Termination of associative-commutative rewriting by dependency pairs
Marché, C
Urbain, X
[J]. REWRITING TECHNIQUES AND APPLICATIONS, 1998, 1379 : 241 - 255
[10] DECOMPOSABLE TERMINATION OF COMPOSABLE TERM REWRITING-SYSTEMS
KURIHARA, M
OHUCHI, A
[J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1995, E78D (04) : 314 - 320

← 1 2 3 4 5 →