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

逻辑约束项重写系统中的约束模式差(完整版)

Difference of Constrained Patterns in Logically Constrained Term Rewrite Systems (Full Version)

Naoki Nishida, Misaki Kojima, Yuto Nakamura

AI总结:

本文扩展了模式差运算符和补集算法至逻辑约束项重写系统(LCTRSs)的约束线性模式,证明带可判定内置理论的左线性LCTRSs的拟可约性可判定,且约束模式差运算仅要求除数模式线性。

摘要:

将模式视为其实例的集合时,模式上的差运算符会计算两个给定模式的有限集合,该集合表示被除数模式与除数模式之间的差。模式的补集是一个模式集合,其基构造器实例构成前者模式基构造器实例的补集。给定有限多个无约束线性模式,使用线性模式上的差运算符,补集算法会返回有限个线性模式的集合作为给定模式的补集。本文将差运算符和补集算法扩展到逻辑约束项重写系统(简称LCTRSs)中使用的约束线性模式,这类系统没有带内置值排序的用户定义构造器项。然后,对于左线性项重写系统,我们利用补集算法证明:对于具有可判定内置理论的此类LCTRSs,拟可约性是可判定的。单次使用约束模式上的差运算符时,仅要求除数模式是线性的。

英文摘要:

Considering patterns as sets of their instances, a difference operator over patterns computes a finite set of two given patterns, which represents the difference between the dividend pattern and the divisor pattern. A complement of a pattern is a pattern set, the ground constructor instances of which comprise the complement of the ground constructor instances of the former pattern. Given finitely many unconstrained linear patterns, using a difference operator over linear patterns, a complement algorithm returns a finite set of linear patterns as a complement of the given patterns. In this paper, we extend the difference operator and complement algorithm to constrained linear patterns used in logically constrained term rewrite systems (LCTRSs, for short) that have no user-defined constructor term with a sort for built-in values. Then, as for left-linear term rewrite systems, using the complement algorithm, we show that quasi-reducibility is decidable for such LCTRSs with decidable built-in theories. For the single use of the difference operator over constrained patterns, only divisor patterns are required to be linear.

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

↑