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 条

[41] FAIRNESS IN TERM REWRITING-SYSTEMS
PORAT, S
FRANCEZ, N
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1985, 202 : 287 - 300
[42] TERMINATION IS NOT MODULAR FOR CONFLUENT VARIABLE-PRESERVING TERM REWRITING-SYSTEMS
OHLEBUSCH, E
[J]. INFORMATION PROCESSING LETTERS, 1995, 53 (04) : 223 - 228
[43] RELATING INNERMOST, WEAK, UNIFORM AND MODULAR TERMINATION OF TERM REWRITING-SYSTEMS
GRAMLICH, B
[J]. LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, 1992, 624 : 285 - 296
[44] OVERLAP CLOSURES DO NOT SUFFICE FOR TERMINATION OF GENERAL TERM REWRITING-SYSTEMS
ZHANG, XB
[J]. INFORMATION PROCESSING LETTERS, 1991, 37 (01) : 9 - 11
[45] Matrix interpretations for proving termination of term rewriting
Endrullis, Joerg
Waldmann, Johannes
Zantema, Hans
[J]. JOURNAL OF AUTOMATED REASONING, 2008, 40 (2-3) : 195 - 220
[46] Matrix Interpretations for Proving Termination of Term Rewriting
Jörg Endrullis
Johannes Waldmann
Hans Zantema
[J]. Journal of Automated Reasoning, 2008, 40 : 195 - 220
[47] Matrix interpretations for proving termination of term rewriting
Endrullis, Jorg
Waldmann, Johannes
Zantema, Hans
[J]. AUTOMATED REASONING, PROCEEDINGS, 2006, 4130 : 574 - 588
[48] COMPUTING WITH GRAPH REWRITING-SYSTEMS WITH PRIORITIES
LITOVSKY, I
METIVIER, Y
[J]. THEORETICAL COMPUTER SCIENCE, 1993, 115 (02) : 191 - 224
[49] ON EQUIVALENCE TRANSFORMATIONS FOR TERM REWRITING-SYSTEMS
TOYAMA, Y
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1986, 220 : 44 - 61
[50] AN ALGEBRAIC STRUCTURE FOR DERIVATIONS IN REWRITING-SYSTEMS
VELINOV, Y
[J]. THEORETICAL COMPUTER SCIENCE, 1988, 57 (2-3) : 205 - 224

← 1 2 3 4 5 →