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

文章基本信息

  • 标题:Complexity Analysis of Term Rewriting Based on Matrix and Context Dependent Interpretations
  • 本地全文:下载
  • 作者:Georg Moser ; Andreas Schnabl ; Johannes Waldmann
  • 期刊名称:LIPIcs : Leibniz International Proceedings in Informatics
  • 电子版ISSN:1868-8969
  • 出版年度:2008
  • 卷号:2
  • 页码:304-315
  • DOI:10.4230/LIPIcs.FSTTCS.2008.1762
  • 出版社:Schloss Dagstuhl -- Leibniz-Zentrum fuer Informatik
  • 摘要:For a given (terminating) term rewriting system one can often estimate its \emph{derivational complexity} indirectly by looking at the proof method that established termination. In this spirit we investigate two instances of the interpretation method: \emph{matrix interpretations} and \emph{context dependent interpretations}. We introduce a subclass of matrix interpretations, denoted as \emph{triangular matrix interpretations}, which induce polynomial derivational complexity and establish tight correspondence results between a subclass of context dependent interpretations and restricted triangular matrix interpretations. The thus obtained new results are easy to implement and considerably extend the analytic power of existing results. We provide ample numerical data for assessing the viability of the method.
  • 关键词:Term Rewriting; Derivational Complexity; Termination; Automation
国家哲学社会科学文献中心版权所有