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 条
  • [41] Non-termination in Term Rewriting and Logic Programming
    Payet, Etienne
    JOURNAL OF AUTOMATED REASONING, 2024, 68 (01)
  • [42] Max/Plus Tree Automata for Termination of Term Rewriting
    Koprowski, Adam
    Waldmann, Johannes
    ACTA CYBERNETICA, 2009, 19 (02): : 357 - 392
  • [43] A Dependency Pair Framework for Relative Termination of Term Rewriting
    Kassing, Jan-Christoph
    Vartanyan, Grigory
    Giesl, Juergen
    AUTOMATED REASONING, IJCAR 2024, PT II, 2024, 14740 : 360 - 380
  • [44] Certification of proving termination of term rewriting by matrix interpretations
    Koprowski, Adam
    Zantema, Hans
    SOFSEM 2008: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2008, 4910 : 328 - 339
  • [45] Automated termination analysis for logic programs by term rewriting
    Schneider-Kamp, Peter
    Giesl, Juergen
    Serebrenik, Alexander
    Thiemann, Rene
    LOGIC-BASED PROGRAM SYNTHESIS AND TRANSFORMATION, 2007, 4407 : 177 - +
  • [46] TERMINATION OF REWRITING
    DERSHOWITZ, N
    JOURNAL OF SYMBOLIC COMPUTATION, 1987, 3 (1-2) : 69 - 116
  • [47] AUTOMATED TERMINATION ANALYSIS OF JAVA']JAVA BYTECODE BY TERM REWRITING
    Otto, Carsten
    Brockschmidt, Marc
    von Essen, Christian
    Giesl, Juergen
    PROCEEDINGS OF THE 21ST INTERNATIONAL CONFERENCE ON REWRITING TECHNIQUES AND APPLICATIONS (RTA'10), 2010, 6 : 259 - 275
  • [48] Persistence of Termination for Locally Confluent Overlay Term Rewriting Systems
    Iwami, Munehiro
    PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 3, 2005, 3 : 106 - 109
  • [49] 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
  • [50] Mechanizing weak termination proving of term rewriting systems by induction
    Feng, S
    Cao, S
    Liu, SX
    COMPUTER SCIENCE AND TECHNOLOGY IN NEW CENTURY, 2001, : 15 - 19
12345