Persistence of Termination for Non-Overlapping Term Rewriting Systems

被引：0
|
作者：
Iwami, Munehiro [1 ]
机构：
[1] Shimane Univ, Fac Sci & Engn, Matsue, Shimane 6908504, Japan
来源：
PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 3 | 2005年 / 3卷
关键词：
Theory of computing; Model-based reasoning; term rewriting system; termination;
D O I：
暂无
中图分类号：
TP39 [计算机的应用];
学科分类号：
081203 ; 0835 ;
摘要：
A property P is called persistent if for any many-sorted term rewriting system R, R has the property P if and only if term rewriting system Theta(R), which results from R by omitting its sort information, has the property P. In this paper, we show that termination is persistent for non-overlapping term rewriting systems and we give the example as application of this result. Furthermore we obtain that completeness is persistent for non-overlapping term rewriting systems.
引用
收藏
页码：138 / 141
页数：4
相关论文
共 50 条
  • [1] Modular Termination for Weak Overlapping Term Rewriting Systems
    Graziani, M.
    Venturini Zilli, M.
    Bulletin of the European Association for Theoretical Computer Science, 1994, (53):
  • [2] Persistence of Termination for Term Rewriting Systems with Ordered Sorts
    Iwami, Munehiro
    PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 3, 2005, 3 : 81 - 85
  • [3] 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
  • [4] Persistence of termination for locally confluent overlay term rewriting systems
    Iwami, M
    Proceedings of the IASTED International Conference on Artificial Intelligence and Applications, Vols 1and 2, 2004, : 529 - 534
  • [5] Persistence of Termination for Right-Linear Overlay Term Rewriting Systems
    Iwami, Munehiro
    PROCEEDINGS OF WORLD ACADEMY OF SCIENCE, ENGINEERING AND TECHNOLOGY, VOL 3, 2005, 3 : 94 - 97
  • [6] On systems of non-overlapping Haar polynomials
    Karagulyan, Grigori A.
    ARKIV FOR MATEMATIK, 2020, 58 (01): : 121 - 131
  • [7] Parallelization of Termination Checker of Term Rewriting Systems
    Ding, Rui
    Sato, Haruhiko
    Kurihara, Masahito
    INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, IMECS 2012, VOL I, 2012, : 757 - 762
  • [8] Decomposable termination of composable term rewriting systems
    Kurihara, Masahito, 1600, Inst of Electronics, Inf & Commun Engineers of Japan, Tokyo, Japan (E78-D):
  • [9] Operational termination of conditional term rewriting systems
    Lucas, S
    Marché, C
    Meseguer, J
    INFORMATION PROCESSING LETTERS, 2005, 95 (04) : 446 - 453
  • [10] ON THE MODULARITY OF TERMINATION OF TERM REWRITING-SYSTEMS
    OHLEBUSCH, E
    THEORETICAL COMPUTER SCIENCE, 1994, 136 (02) : 333 - 360
12345