arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0904.0570cs.LOcs.AIcs.CCcs.PL
收藏

依赖对方法引起的导数复杂性

The Derivational Complexity Induced by the Dependency Pair Method

University of Innsbruck(因斯布鲁克大学)

Georg Moser, Andreas Schnabl

摘要:

我们研究了依赖对方法引起的衍生复杂性,增强了标准的改进。我们得到的依赖对方法的基础技术的派生复杂性方面的派生复杂性的上界。特别是,我们表明,衍生复杂性的依赖对方法的基础上,一些直接的技术,可能细化参数过滤,可用的规则标准,或依赖图,是原始递归的衍生复杂性的直接方法。这意味着基于传统终止顺序(如KBO、LPO和MPO)的依赖对方法的标准应用所引起的推导复杂度与这些顺序作为唯一终止技术应用时完全相同。

英文摘要:

We study the derivational complexity induced by the dependency pair method, enhanced with standard refinements. We obtain upper bounds on the derivational complexity induced by the dependency pair method in terms of the derivational complexity of the base techniques employed. In particular we show that the derivational complexity induced by the dependency pair method based on some direct technique, possibly refined by argument filtering, the usable rules criterion, or dependency graphs, is primitive recursive in the derivational complexity induced by the direct method. This implies that the derivational complexity induced by a standard application of the dependency pair method based on traditional termination orders like KBO, LPO, and MPO is exactly the same as if those orders were applied as the only termination technique.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑