arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1802.06497cs.LO
收藏

约束TRS的依赖链到有界单调整数序列的变换

Transforming Dependency Chains of Constrained TRSs into Bounded Monotone Sequences of Integers

Tomohiro Sasano, Naoki Nishida, Masahiko Sakai, Tomoya Ueyama

摘要:

在重写系统可终止性证明的依赖对框架中,多项式解释用于将依赖链转化为有界递减的整数序列,对于可终止性证明的成功,特别是对于有约束的重写系统,多项式解释起着重要的作用。在本文中,我们给出了线性多项式解释的充分条件,将依赖链转化为有界单调(即,递减或递增)整数序列。这样的多项式解释将原始系统的重写序列变换为独立于依赖性链的变换的递减或递增序列。当我们将重写序列转换为递增序列时,多项式解释对于标记函数符号的可约位置具有非正系数。我们提出了四个DP处理器参数化的依赖链和重写序列转换成无论是减少或增加的整数序列,分别。我们表明,这种多项式的解释,使我们成功地证明麦卡锡91函数的终止整数。

英文摘要:

In the dependency pair framework for proving termination of rewriting systems, polynomial interpretations are used to transform dependency chains into bounded decreasing sequences of integers, and they play an important role for the success of proving termination, especially for constrained rewriting systems. In this paper, we show sufficient conditions of linear polynomial interpretations for transforming dependency chains into bounded monotone (i.e., decreasing or increasing) sequences of integers. Such polynomial interpretations transform rewrite sequences of the original system into decreasing or increasing sequences independently of the transformation of dependency chains. When we transform rewrite sequences into increasing sequences, polynomial interpretations have non-positive coefficients for reducible positions of marked function symbols. We propose four DP processors parameterized by transforming dependency chains and rewrite sequences into either decreasing or increasing sequences of integers, respectively. We show that such polynomial interpretations make us succeed in proving termination of the McCarthy 91 function over the integers.

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

↑