Proceedings

Algebraic Manipulations as a Unification and Matching Strategy for Linear Equations in Signed Binary Trees

Download BibTeX Cite

Proceedings of the Seventh International Joint Conference on Artificial Intelligence. Automatic Programming. Pages 1016-1022.

Abstract

We study the unification and matching problems in the signed binary trees theory. We show that any equation tl•t2 can be transformed into an equivalent one x=t. If x does not occur in t then (x ---> t) is the unique most general unifier in the theory (up to an isomorphism). We apply this technique to find recurrence relations between sets of terms. These relations are used to synthesize LISP programs from a set of input traces.

Claude Kirchner, Hélène Kirchner, and Jean-Pierre Jouannaud. 1981. Algebraic Manipulations as a Unification and Matching Strategy for Linear Equations in Signed Binary Trees. In Proceedings of the Seventh International Joint Conference on Artificial Intelligence, IJCAI-81. IJCAI, 1016–1022. https://ijcai.org/proceedings/1981/194
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards