A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
A decision algorithm for distributive unification

1998
*
Theoretical Computer Science
*

The purpose of this paper is to describe a decision algorithm for unifiability of equations w.r.t. the equational theory D of two distributive axioms: x * (y + z) = x * .L' + Y * 2 and (X + y ) *z = x * z + y * z. The algorithm is described as a set of non-deterministic transformation rules. The equations given as input are eventually transformed into an ACl-unification-problem with linear constant restrictions. Since the algorithm terminates. this is a solution for an open problem in the field

doi:10.1016/s0304-3975(98)00081-4
fatcat:odbx6fippjardis5viyq72cegu