{"type":"ScholarlyArticle","title":"A Complete Unification Algorithm for Associative-Commutative Functions","authors":[{"name":"Mark E. Stickel","slug":"mark-e-stickel","given":"Mark E.","family":"Stickel","affiliation":"Department of Computer Science Carnegie-Mellon University Pittsburgh , Pennsylvania"}],"abstract":"An important component of mechanical theorem provinc systems are unification algorithms which find most general sul!stitutions which, when applied to two expresssions, make them equivalent. Functions which are associat i ve and commutative (such as the arithmetic addition and multiplication functions) are often the subject of mechanical theorem proving . An algorithm which unifies terms whose function is associative and commutative is presented here. The algorithm eliminates the need for axiomatizing the usoeiativity and commutativity properties and returns 1 complete set of unifiers without recourse to the · indefinite generation of variants and instances of the terms beinc unified required by previous solutions to the problem.","doi":null,"url":"https://ijcai.org/proceedings/1975/12","pdf":"https://ijcai.org/proceedings/1975/0012.pdf","markdown":"https://ijcai.org/proceedings/1975/12.md","bibtex":"https://ijcai.org/proceedings/1975/bibtex/12","volume":{"slug":"1975","title":"Proceedings of the Fourth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1975","url":"https://ijcai.org/proceedings/1975/","year":1975,"location":"Tbilisi, Georgia, USSR","dates":"","editors":"Patrick Winston and Carl Hewitt","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Mathematical and Theoretical Aspects of A.I","track":"Mathematical and Theoretical Aspects of A.I","number":12,"pages":{"first":71,"last":75},"keywords":[],"videos":[],"references":[{"position":1,"raw":"Chang, C. L. and Lee, R. C. T. Symbolic• l.otic ami Mnchnrricol Tlwtort!ln ProtJirrg. Acedemic Press, New York, 1973.","title":"Symbolic• l.otic ami Mnchnrricol Tlwtort!ln ProtJirrg","authors":"C L Chang, R C T Lee","year":"1973","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"Nevins, A. J. A human oriented logic for automatic theorem proving.}. IJCM 21, 4 (Oct. 1974), 606•621.","title":"A human oriented logic for automatic theorem proving","authors":"A J Nevins","year":"1974","venue":"IJCM","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"Plotkin, G. D. Building-in equelionel theories. In Meltzer, B. and Michie, D. (Eds.). Machine /rut!lligertce 7, Edinburgh University Press, Edinburgh, 1972, pp. 73•90.","title":"Building-in equelionel theories","authors":"G D Plotkin","year":"1972","venue":"Machine /rut!lligertce 7","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"Reboh, R. and Secerdoti, E. A preliminary QL!SP manual. T ec:hnic:al Note 81, Artificial Intelligence Center, Stanford Researc:h Institute, Menlo Park, Calif., Aug. 1973.","title":"A preliminary QL!SP manual","authors":"R Reboh, E Secerdoti","year":"1973","venue":"T ec:hnic:al Note 81","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"Robinson, G. end Wos, L. Peramodulalion and theorem•proving in firsl•order theories with equality. In","title":"Peramodulalion and theorem•proving in firsl•order theories with equality","authors":"G Robinson, L Wos","year":null,"venue":null,"doi":null,"url":null,"internal_url":null},{"position":6,"raw":"Meltzer, B. and Michie, D. (Eds.). M ar.hirrf! I ruelligerrce 4, Edinburgh University Press, Edinburr;h, 1969, pp. 135-150.","title":"M ar.hirrf! I ruelligerrce 4","authors":null,"year":"1969","venue":null,"doi":null,"url":null,"internal_url":null},{"position":7,"raw":"Robinson, J. A. A mac:hine•oriented logic based on the resolution principle. }. IJCM 12, I (Jan. 1965), 23•41.","title":"A mac:hine•oriented logic based on the resolution principle","authors":"J A Robinson","year":"1965","venue":"IJCM","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"Rulifson, J. F., Derksen, J. A. and Waldinger, R. J. QA4: 1 procedural calculus for intuitive reasoning. Technical Note 73, Artificial Intelligence Center, Stanford Research Institute, Menlo Park, Calif., Nov. 1972.","title":"QA4: 1 procedural calculus for intuitive reasoning","authors":"J F Rulifson, J A Derksen, R J Waldinger","year":"1972","venue":null,"doi":null,"url":null,"internal_url":null},{"position":9,"raw":"Slagle, J. R. Automated theorem-proving for theories with aimplifiers, commutativity, and associativity. } . IJC41 21, 4 (Ott. 1974), 622-642.","title":"Automated theorem-proving for theories with aimplifiers, commutativity, and associativity","authors":"J R Slagle","year":"1974","venue":"IJC","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"Stickel, M. E. Unific:ation alr;orithms for artificial intelligence languar;es. Chapter of incomplete Ph.D. Dissertation, Department of Computer Science, Cernegie•Mellon University, Pittsburgh, Penn.","title":"ation alr;orithms for artificial intelligence languar;es. Chapter of incomplete","authors":"M E Stickel, Unific","year":null,"venue":null,"doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}