Term rewriting system is a simple and powerful computing model and it has important applications in many fields .

项 重写 系统是一种简洁通用的计算模型，在许多领域中有着重要的应用。

Parallel implementation approaches of term rewriting system

项 重写 系统的并行实现方案

These results can direct the implementing of term rewriting system by graph rewriting system .

以上结果能够用于指导 项 重写的图 实现。

Graph rewriting is an efficient technique for implementing term rewriting system . From the angle of implementation we study the soundness and completeness of graph rewriting simulating term rewriting .

图重写能够有效地实现 项 重写. 文章从项 重写的图实现的角度出发，研究了图重写模拟项重写的正确性和完备性；

The compressed path ordering and the structure measure of term rewriting system

压缩路径序与 重写 系统的结构测度

Semiregular term rewriting system and its confluence

半正则 重写 系统及其合流性

The Confluence of Left & linear Term Rewriting System

左线性 重写 系统的合流性

The structure measure is very important to prove the confluence of term rewriting system . This paper discusses the effective definition approach of structure measure .

结构测度对于判别 重写 系统的合流性是极为重要的，本文着重研究结构测度的有效定义方法。

This paper describes the theory of machine discovery logic based on second order term rewriting technology as well as two experiment system DL and ALP .

介绍了基于二阶 项 重写技术的机器发现逻辑理论及两个实验 系统DI和ALP。

In this paper the symbolic measure is introduced and semiregularity is defined and the confluence of semiregular term rewriting system is proved .

本文着重研究 重写 系统的合流性，通过引入符号测度的概念，本文定义了半正则 重写 系统，并证明了半正则 重写 系统的合流性。

The order could not only examine the termination of term rewriting system but also has the advantage of automated computing and less rules using .

该序不仅能够检测 项 重写 系统的终止性，而且具有易于自动化运算，规则调用次数较少的优点。