The Termination Hierarchy for Term Rewriting

被引：0
|
作者：
H. Zantema
机构：
[1] Department of Computing Science,
[2] Eindhoven University of Technology,undefined
[3] P.O. Box 513,undefined
[4] 5600 MB Eindhoven,undefined
[5] The Netherlands (e-mail: h.zantema@tue.nl),undefined
来源：
Applicable Algebra in Engineering, Communication and Computing | 2001年 / 12卷
关键词：
Keywords: Term rewriting, Termination, String rewriting, Monotone algebras.;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
A number of properties of term rewriting systems related to termination are discussed. It is examined how these properties are affected by modifications in the definitions like weakening the requirement of strict monotonicity and adding embedding rules. All counterexamples to prove non-equivalence of properties are string rewriting systems, in most cases even single string rewrite rules.
引用
收藏
页码：3 / 19
页数：16
相关论文
共 50 条
  • [21] Operational termination of conditional term rewriting systems
    Lucas, S
    Marché, C
    Meseguer, J
    INFORMATION PROCESSING LETTERS, 2005, 95 (04) : 446 - 453
  • [22] Termination of just/fair computations in term rewriting
    Lucas, Salvador
    Meseguer, Jose
    INFORMATION AND COMPUTATION, 2008, 206 (05) : 652 - 675
  • [23] PROVING TERMINATION FOR TERM REWRITING-SYSTEMS
    WEIERMANN, A
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 626 : 419 - 428
  • [24] MODULAR TERM REWRITING-SYSTEMS AND THE TERMINATION
    KURIHARA, M
    KAJI, I
    INFORMATION PROCESSING LETTERS, 1990, 34 (01) : 1 - 4
  • [25] Matrix interpretations for proving termination of term rewriting
    Endrullis, Joerg
    Waldmann, Johannes
    Zantema, Hans
    JOURNAL OF AUTOMATED REASONING, 2008, 40 (2-3) : 195 - 220
  • [26] Matrix Interpretations for Proving Termination of Term Rewriting
    Jörg Endrullis
    Johannes Waldmann
    Hans Zantema
    Journal of Automated Reasoning, 2008, 40 : 195 - 220
  • [27] Size-change termination for term rewriting
    Thiemann, R
    Giesl, J
    REWRITING TECNIQUES AND APPLICATIONS, PROCEEDINGS, 2003, 2706 : 264 - 278
  • [28] Termination of term rewriting using dependency pairs
    Arts, T
    Giesl, J
    THEORETICAL COMPUTER SCIENCE, 2000, 236 (1-2) : 133 - 178
  • [29] Matrix interpretations for proving termination of term rewriting
    Endrullis, Jorg
    Waldmann, Johannes
    Zantema, Hans
    AUTOMATED REASONING, PROCEEDINGS, 2006, 4130 : 574 - 588
  • [30] TERMINATION OF LINEAR BOUNDED TERM REWRITING SYSTEMS
    Durand, Irene
    Senizergues, Geraud
    Sylvestre, Marc
    PROCEEDINGS OF THE 21ST INTERNATIONAL CONFERENCE ON REWRITING TECHNIQUES AND APPLICATIONS (RTA'10), 2010, 6 : 341 - 356
12345