Foundations of logic programming; (2nd extended ed.)
Foundations of logic programming; (2nd extended ed.)
SYNTACTIC ELEMENTS OF DECLARATIVE PROGRAMMING: SYMBOLIC LINEAR EQUATIONS
Fundamenta Informaticae
Hi-index | 0.00 |
We use the ring of p-tangles to submerge symbolic expressions in a module structure. Using this structure, the problem of unifying expressions is shown to be equivalent to certain linear systems of equations with coefficients in the ring, whose solution gives the result of unification, if this exists.