首页    期刊浏览 2024年11月10日 星期日
登录注册

文章基本信息

  • 标题:Termination Proofs in the Dependency Pair Framework May Induce Multiple Recursive Derivational Complexity
  • 本地全文:下载
  • 作者:Georg Moser ; Andreas Schnabl
  • 期刊名称:LIPIcs : Leibniz International Proceedings in Informatics
  • 电子版ISSN:1868-8969
  • 出版年度:2011
  • 卷号:10
  • 页码:235-250
  • DOI:10.4230/LIPIcs.RTA.2011.235
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要:We study the complexity of rewrite systems shown terminating via the dependency pair framework using processors for reduction pairs, dependency graphs, or the subterm criterion. The complexity of such systems is bounded by a multiple recursive function, provided the complexity induced by the employed base techniques is at most multiple recursive. Moreover this upper bound is tight.
  • 关键词:Complexity; DP Framework; Multiple Recursive Functions
国家哲学社会科学文献中心版权所有