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.
The Unification Type of an Equational Theory May Depend on the Instantiation Preorder: From Results for Single Theories to Results for Classes of Theories
TU Dresden(德累斯顿工业大学);Center for Scalable Data Analytics and Artificial Intelligence (ScaDS.AI) Dresden/Leipzig(德累斯顿/莱比锡可扩展数据分析与人工智能中心)
我们考虑的统一模的方程理论ACh的问题,其中包括一个功能符号$h$,这是同态的结合交换运营商$+$。由于统一模ACh理论是不可判定的,我们定义了一个变种的问题称为\textit{bounded ACh unification}。在ACh统一的这个有界版本中,我们本质上限制了$h$可以递归地应用于一个项的次数,并且只允许满足这个限制的解决方案。术语中$h$的出现次数没有限制,并且$+$符号可以应用无限次。我们给推理规则解决有界版本的问题,并证明规则是健全的,完整的,和终止。我们已经在Maude中实现了该算法,并给出了实验结果。我们认为,该算法是有用的密码协议分析。