MODULAR TERM REWRITING-SYSTEMS AND THE TERMINATION

被引：14

|

作者：

KURIHARA, M

KAJI, I

机构：

[1] Department of Information Engineering, Hokkaido University, Sapporo

来源：

INFORMATION PROCESSING LETTERS | 1990年 / 34卷 / 01期

关键词：

Term rewriting system; termination;

D O I：

10.1016/0020-0190(90)90221-I

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

[No abstract available]

引用

收藏

页码：1 / 4

页数：4

相关论文

共 50 条

[1] ON THE MODULARITY OF TERMINATION OF TERM REWRITING-SYSTEMS
OHLEBUSCH, E
THEORETICAL COMPUTER SCIENCE, 1994, 136 (02) : 333 - 360
[2] RELATING INNERMOST, WEAK, UNIFORM AND MODULAR TERMINATION OF TERM REWRITING-SYSTEMS
GRAMLICH, B
LECTURE NOTES IN ARTIFICIAL INTELLIGENCE, 1992, 624 : 285 - 296
[3] TERMINATION IS NOT MODULAR FOR CONFLUENT VARIABLE-PRESERVING TERM REWRITING-SYSTEMS
OHLEBUSCH, E
INFORMATION PROCESSING LETTERS, 1995, 53 (04) : 223 - 228
[4] PROVING TERMINATION FOR TERM REWRITING-SYSTEMS
WEIERMANN, A
LECTURE NOTES IN COMPUTER SCIENCE, 1992, 626 : 419 - 428
[5] A LOCAL TERMINATION PROPERTY FOR TERM REWRITING-SYSTEMS
LATCH, DM
SIGAL, R
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 355 : 222 - 233
[6] DECOMPOSABLE TERMINATION OF COMPOSABLE TERM REWRITING-SYSTEMS
KURIHARA, M
OHUCHI, A
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 1995, E78D (04) : 314 - 320
[7] MODULAR PROPERTIES OF CONDITIONAL TERM REWRITING-SYSTEMS
MIDDELDORP, A
INFORMATION AND COMPUTATION, 1993, 104 (01) : 110 - 158
[8] MODULAR TERMINATION OF R-CONSISTENT AND LEFT-LINEAR TERM REWRITING-SYSTEMS
SCHMIDTSCHAUSS, M
MARCHIORI, M
PANITZ, SE
THEORETICAL COMPUTER SCIENCE, 1995, 149 (02) : 361 - 374
[9] A PATH ORDERING FOR PROVING TERMINATION OF TERM REWRITING-SYSTEMS
KAPUR, D
NARENDRAN, P
SIVAKUMAR, G
LECTURE NOTES IN COMPUTER SCIENCE, 1985, 185 : 173 - 187
[10] DECIDABILITY OF CONFLUENCE AND TERMINATION OF MONADIC TERM REWRITING-SYSTEMS
SALOMAA, K
LECTURE NOTES IN COMPUTER SCIENCE, 1991, 488 : 275 - 286

← 1 2 3 4 5 →