期刊专题

10.3969/j.issn.1002-137X.2001.07.028

项重写系统弱基终止性的归纳证明

引用
This paper proposes a novel method for proving weakly ground termination in a restricted domain of a term rewriting system based on structural and cover set induction. For this prupose,we introduce the concepts of base set and set of ground terms defined recursively over base sets,which plays a crucial role in the inductive method. The method can be used for non-terminating,non-confluent and/or non-linear term rewriting systems,and have application in inductive equivalence testing and program verification.

Weakly ground termination、Induction、Term rewriting systems、Automated proving

28

TP3(计算技术、计算机技术)

国家自然科学基金19931020

2004-01-08(万方平台首次上网日期,不代表论文的发表时间)

共4页

105-108

暂无封面信息
查看本期封面目录

计算机科学

1002-137X

50-1075/TP

28

2001,28(7)

专业内容知识聚合服务平台

国家重点研发计划“现代服务业共性关键技术研发及应用示范”重点专项“4.8专业内容知识聚合服务技术研发与创新服务示范”

国家重点研发计划资助 课题编号:2019YFB1406304
National Key R&D Program of China Grant No. 2019YFB1406304

©天津万方数据有限公司 津ICP备20003920号-1

信息网络传播视听节目许可证 许可证号:0108284

网络出版服务许可证:(总)网出证(京)字096号

违法和不良信息举报电话:4000115888    举报邮箱:problem@wanfangdata.com.cn

举报专区:https://www.12377.cn/

客服邮箱:op@wanfangdata.com.cn