%0 Journal Article
%T Reduction of cycle unification of type Cpg+r<br>Reduction of Cycle Unification of Type Cpg+r
%A Hu Yunfa
%A and Wolfgang Bibel
%A <br>Hu Yunfa
%A Wolfgang Bibel
%J 计算机科学技术学报
%D 1998
%I 
%X In this paper a class of cycle unification problems called type Cpg r is studied, and an intuitive representation method, called the position supergraph, is presented to analyze or reduce the cycle problem. A typical case of Cpg r problems is considered and an algorithm is given, which transforms the original problem of Cpg r that is of the exponential complexity into a new one that is of the linear complexity when using SLD resolution method. These results are of importance for practice and theory.
%K Cycle unification
%K reduction
%K SLD resolution method<br>数据库
%K 程序变换
%K 循环统一问题
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=823F7DD829603068DE984B8E60414922&yid=8CAA3A429E3EA654&vid=FC0714F8D2EB605D&iid=CA4FD0336C81A37A&sid=13553B2D12F347E8&eid=B91E8C6D6FE990DB&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=0&reference_num=7