Variant-based Equational Unification under Constructor Symbols

by   Damián Aparicio-Sánchez, et al.

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.



page 1

page 2

page 3

page 4


Most General Variant Unifiers

Equational unification of two terms consists of finding a substitution t...

Inspecting Maude Variants with GLINTS

This paper introduces GLINTS, a graphical tool for exploring variant nar...

Dormancy-aware timed branching bisimilarity

A variant of the standard notion of branching bisimilarity for processes...

On Extremal Rates of Secure Storage over Graphs

A secure storage code maps K source symbols, each of L_w bits, to N code...

On-line Recognition of Handwritten Mathematical Symbols

Finding the name of an unknown symbol is often hard, but writing the sym...

On estimating the alphabet size of a discrete random source

We are concerned with estimating alphabet size N from a stream of symbol...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.