%0 Journal Article
%T SCHEME SIMPLIFICATION ORDERING AND TERMINATION OF TERM REWRITING SYSTEM<br>模式化简序与重写系统的终止性
%A Lin Kai
%A Sun Yongqiang
%A Lu Ruzhan
%A <br>林凯
%A 孙永强
%A 陆汝占
%J 软件学报
%D 1992
%I 
%X In this paper, the notions of scheme simplification ordering are introduced, and a new method for proving termination rewriting is given. At the same time, scheme recursive path ordering is discussed, and the upper and lower extension of rewriting rule w.r.t. scheme set are defined. By this, finally we show how to prove termination of rewriting using scheme recursive path ordering.
%K 模式化简序
%K 重写系统
%K 终止性
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=ED2D83E2414F4449F8C23194081B09C3&yid=F53A2717BDB04D52&vid=38B194292C032A66&iid=38B194292C032A66&sid=1371F55DA51B6E64&eid=B6DA1AC076E37400&journal_id=1000-9825&journal_name=软件学报&referenced_num=0&reference_num=8