摘要
研究了一种求解包含一个IDB谓词线性递归程序的算法,该算法由规则间的相关性对逻辑程序进行分解,减少IDB谓词项的个数,然后再对分解后的子程序进行魔转换。并提出了对该算法的进一步优化方案。最后对算法中引入的ID号做了开销分析。
An effective algorithm is applicable to program including one IDB predicates. It decomposes the logic program according to relativities of rules and reduces the number of IDB predicates. Then magic transformation is applied to sub-program. A proposal to optimize the method is put forward. The cost of ID introduced in the algorithm is analyzed.
出处
《中国民航学院学报》
2005年第2期22-26,共5页
Journal of Civil Aviation University of China