COMPLETENESS OF COMBINATIONS OF CONDITIONAL CONSTRUCTOR SYSTEMS

被引：5
|
作者：
MIDDELDORP, A
机构：
[1] Institute of Information Sciences and Electronics, University of Tsukuba, Tsukuba
来源：
JOURNAL OF SYMBOLIC COMPUTATION | 1994年 / 17卷 / 01期
关键词：
D O I：
10.1006/jsco.1994.1002
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper we extend the divide and conquer technique of Middeldorp and Toyama for establishing (semi-)completeness of constructor systems to conditional constructor systems. We show that both completeness (i.e. the combination of confluence and strong normalisation) and semi-completeness (confluence plus weak normalisation) are decomposable properties of conditional constructor systems without extra variables in the conditions of the rewrite rules. © 1994 Academic Press Limited.
引用
收藏
页码：3 / 21
页数：19
相关论文
共 50 条
  • [1] COMPLETENESS OF COMBINATIONS OF CONSTRUCTOR SYSTEMS
    MIDDELDORP, A
    TOYAMA, Y
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1991, 488 : 188 - 199
  • [2] COMPLETENESS OF COMBINATIONS OF CONSTRUCTOR SYSTEMS
    MIDDELDORP, A
    TOYAMA, Y
    [J]. JOURNAL OF SYMBOLIC COMPUTATION, 1993, 15 (03) : 331 - 348
  • [3] CONDITIONAL COMBINATIONS OF QUANTUM SYSTEMS
    Svitek, Miroslav
    [J]. NEURAL NETWORK WORLD, 2011, 21 (01) : 67 - 73
  • [4] Modular properties of constructor-sharing conditional term rewriting systems
    Ohlebusch, E
    [J]. CONDITIONAL AND TYPED REWRITING SYSTEMS, 1995, 968 : 296 - 315
  • [5] Innocuous constructor-sharing combinations
    Dershowitz, N
    [J]. REWRITING TECHNIQUES AND APPLICATIONS, 1997, 1232 : 202 - 216
  • [6] On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
    Gramlich, B
    [J]. THEORETICAL COMPUTER SCIENCE, 1996, 165 (01) : 97 - 131
  • [7] Computational completeness of tissue P systems with conditional uniport
    Verlan, Sergey
    Bernardini, Francesco
    Gheorghe, Marian
    Margenstern, Maurice
    [J]. MEMBRANE COMPUTING, 2006, 4361 : 521 - +
  • [8] On termination and confluence properties of disjoint and constructor-sharing conditional rewrite systems
    Universitaet Kaiserslautern, Kaiserslautern, Germany
    [J]. Theor Comput Sci, 1 (97-131):
  • [9] A STRUCTURAL COMPLETENESS THEOREM FOR A CLASS OF CONDITIONAL REWRITE RULE SYSTEMS
    VOROBYOV, SG
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1990, 417 : 313 - 326
  • [10] Proving sufficient completeness of constructor-based algebraic specifications
    Nakamura, Masaki
    Gaina, Daniel
    Ogata, Kazuhiro
    Futatsugi, Kokichi
    [J]. Lecture Notes in Electrical Engineering, 2015, 373 : 15 - 21
12345