{"type":"ScholarlyArticle","title":"Algebraic Manipulations as a Unification and Matching Strategy for Linear Equations in Signed Binary Trees","authors":[{"name":"Claude Kirchner","slug":"claude-kirchner","given":"Claude","family":"Kirchner","affiliation":""},{"name":"Hélène Kirchner","slug":"helene-kirchner","given":"Hélène","family":"Kirchner","affiliation":""},{"name":"Jean-Pierre Jouannaud","slug":"jean-pierre-jouannaud","given":"Jean-Pierre","family":"Jouannaud","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/1981/194","pdf":"https://ijcai.org/proceedings/1981/0194.pdf","markdown":"https://ijcai.org/proceedings/1981/194.md","bibtex":"https://ijcai.org/proceedings/1981/bibtex/194","volume":{"slug":"1981","title":"Proceedings of the Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1981","url":"https://ijcai.org/proceedings/1981/","year":1981,"location":"Vancouver, British Columbia, Canada","dates":"24-28 August 1981","editors":"Roger C. Schank","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Automatic Programming","track":"Automatic Programming","number":194,"pages":{"first":1016,"last":1022},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}