arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.11070cs.LO
收藏

构造函数符号下基于变分的方程统一

Variant-based Equational Unification under Constructor Symbols

Damián Aparicio-Sánchez, Santiago Escobar, Julia Sapiña

摘要:

两项的等式统一包括找到一个替换,当应用于两项时,使它们在某些等式属性的模上相等。一个基于窄化的等式统一算法依赖于一个术语的变体的概念,在Maude的最新版本3.0中可用,该版本提供了相当复杂的统一功能。项t的变体是由替换σ和tsigma的标准形式组成的对。当方程理论满足有限变分性质时,基于变分的统一是可判定的。然而,该统一过程不考虑构造器符号,因此可能计算比必要的多得多的统一器,或者可能无法立即停止。在本文中,我们集成的概念,构造符号的变量为基础的统一算法。我们在正负统一问题上的实验显示了令人印象深刻的加速。

英文摘要:

Equational unification of two terms consists of finding a substitution that, when applied to both terms, makes them equal modulo some equational properties. A narrowing-based equational unification algorithm relying on the concept of the variants of a term is available in the most recent version of Maude, version 3.0, which provides quite sophisticated unification features. A variant of a term t is a pair consisting of a substitution sigma and the canonical form of tsigma. Variant-based unification is decidable when the equational theory satisfies the finite variant property. However, this unification procedure does not take into account constructor symbols and, thus, may compute many more unifiers than the necessary or may not be able to stop immediately. In this paper, we integrate the notion of constructor symbol into the variant-based unification algorithm. Our experiments on positive and negative unification problems show an impressive speedup.

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

↑