{"type":"ScholarlyArticle","title":"Associative Commutative Pattern Matching","authors":[{"name":"Jean-Marie Hullot","slug":"jean-marie-hullot","given":"Jean-Marie","family":"Hullot","affiliation":""}],"abstract":"Plotkin [10] has opened the way to the design of unification alRorithm i ncorporating equality axioms and their use in complete proof systems. In particular he gives ~omplete unificati 0n algorithms for terms containing associative function s~hols and for an arithmetic theor y . Huet gives in [18] a unification algorithm for ~-conversion and discusses in [19] Reneral prop ~ rties of complete set of unifiers. A complete and finite alRorithm for unification with associative commutative function symbols is given in Stickel [14] and Lanyford shows in [22] how to ex tend it to abelian group theory. Various other specific unification problems are d i scussed in [ 9,15, 23], In the case of equational theories which possess a complete set of reductions as de f ined in Knuth-Bendix [7], Fay has given in [20,21] a general unification algorithm, We are interested in this paper in the special case of commutative associative fun~tion symbols, We first study the equivalence problem which is reduced to regognizing the equal i ty of two multiset representations. In the same way, matching reduces to generating ordered partit i ons of a multiset, This generation is carried out by two processe~ operating on tree data structure s spanning the lattice of partitions. Cardinality conditions inherited from the matching pr 0 blem are used to cut the search drastically : our processes operate bidirectionnally in a cor o ut i ne mauner, each one trimming sub-structures from both search spaces. The two processes are formally defined by a unique recursive definition, and their computations correspond to a call- ~ y need interpretation of this definition. The correctness of the method is proved formally. This basic organization is used to derive a new algorithm for associative commutative unification improving over Stickel [14]. 1 '~e have programmed in LISP all these algorithms, using 11niversity of Vincennes's V-LISP system [3], We have applied them to the Stickel-Peterson's generali:!:ation of the Knuth and Bendix extension algorithm [7,8,16], Their alp.orithm relies on associativecommutative unification for the computation of critical pairs, hut also most critically O il associative-commutative match, in order to reduce terms to their normal forms. ~tickel and Peterson proposed to use unification for matching, hut this leads to unnecessary inefficienc i es that preclude the practical use of their method, Fe give in the Appendix running times on a DEC KLIO using the VLISP system, correspondinp, to some of their examples, Most proofs are omitted in this version, the full paper is available as a techn i cal report [24],","doi":null,"url":"https://ijcai.org/proceedings/1979/88","pdf":"https://ijcai.org/proceedings/1979/0088.pdf","markdown":"https://ijcai.org/proceedings/1979/88.md","bibtex":"https://ijcai.org/proceedings/1979/bibtex/88","volume":{"slug":"1979","title":"Proceedings of the Sixth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1979","url":"https://ijcai.org/proceedings/1979/","year":1979,"location":"Tokyo, Japan","dates":"August 20-23, 1979","editors":"Bruce G. Buchanan","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":null,"track":"","number":88,"pages":{"first":null,"last":null},"keywords":[],"videos":[],"references":[{"position":1,"raw":"E. BALAS: \"An additive a l gorithm for solvin~ linear programs with zero one variables\". Op. Roo. 13 ( 1965).","title":"An additive a l gorithm for solvin~ linear programs with zero one variables","authors":"E Balas","year":"1965","venue":"Op. Roo","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"V.J. BOW/IAN & J.H. STARR : \"Partial orderingl in impli- cit enUD!eration\" An. of discr. math. 1 (1977).","title":"Partial orderingl in implicit enUD!eration","authors":"V J Bow, J H Ian, Starr","year":"1977","venue":"An. of discr. math","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"J. CHAILLOUX : VLISP 10.3 manuel de rfffrence Uni. Paris 8, Vincennes (1978). '","title":"VLISP 10.3 manuel de rfffrence Uni","authors":"J Chailloux","year":"1978","venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"P. GREUSSAY : \"Contribution 1 la dEfinition interprHa- t i ve et .a 1 'implfmentation des lambda-lanaagea,.. Thfae n 78-2, Paris 7(1977).","title":"Contribution 1 la dEfinition interprHat i ve et .a 1 'implfmentation des lambda-lanaagea","authors":"P Greussay","year":"1977","venue":"Thfae n","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"G. HUET : \"An algorithm to generate the basi• of solu- tiona to hoa\\Ogeneous linear diophantine equations\". Inf . Proc. Let.7, 3 April 78.","title":"An algorithm to generate the basi• of solutiona to hoa\\Ogeneous linear diophantine equations","authors":"G Huet","year":null,"venue":"Inf . Proc. Let","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"G. HUET : \"Confluent reductions : Abstract properties and Application• to tenn rewritin~ systems\" In J't'oc. of the 18th Symposium on FOCS (1977). .","title":"Confluent reductions : Abstract properties and Application• to tenn rewritin~ systems","authors":"G Huet","year":"1977","venue":"J't'oc. of the 18th Symposium on FOCS","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"D. E. KNUTH & P.B. BENDIX : \"~imple vord problems in uni- versal Algebras\". In Leech, J.(Ed . ), Col\"p. problema in Abstract Algebras. Perga11101on Press, 1970.","title":"~imple vord problems in universal Algebras","authors":"D E Knuth, P B Bendix","year":"1970","venue":"Col\"p","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"D.S. LA!/KF()RD & A.M. BALLANTYNE : \"Decision procedures for simple equational theories with commutative-associa- tive axioma : co~lete sets of commutative associative reductions''. Tech. rep. MAth. dept. U. of Texas at Austin, ATP 39 (1977).","title":"Decision procedures for simple equational theories with commutative-associative axioma : co~lete sets of commutative associative reductions","authors":"D S La!/Kf()rd, A M Ballantyne","year":"1977","venue":"Tech. rep. MAth. dept. U. of Texas at Austin, ATP","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"M. UVESEY & J. SIF:KJ.IMIN : \"Unification of A+C-terma (hags) and A+C+I-terms (sets)\". Int. Ber. Nr 3176, Inat. fur Inf. I, Universitat ~~rlsruhe.","title":"Unification of A+C-terma (hags) and A+C+I-terms (sets)","authors":"M Uvesey, J Sif, Kj, Imin","year":null,"venue":"Int. Ber. Nr 3176","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"l G. PLOTKIN : \"Building in equational theories\" In l'elt- z~r & Michie(Ed) Machine Intelligence 7 ~dinburgh University Pr••• 1972.","title":"Building in equational theories","authors":"G Plotkin","year":"1972","venue":"Machine Intelligence","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"I r l R. REBIJH & E. SACERDOTI : \"A oreliminary Q-LISP l'anual\". Tech . note 81, SRI, Menlo Park, 1973.","title":"A oreliminary Q-LISP l'anual","authors":"R Rebijh, E Sacerdoti","year":"1973","venue":null,"doi":null,"url":null,"internal_url":null},{"position":12,"raw":"J.F. RULIFSON, J.A. DERKSEN~ R.o! . W .4LD!NGER : \"llA4 : a procedural calculus for intuitive reasonning''. •Tech. Note 71, SRI, Menlo Park, 1972. }o(2 36\" 4' 13' 412 lll + ~I u2 + ~I ul +~2 -u2 + ~2 I\" 21\" 25\" 45\" 49\" 2\" I I 20 11 I I 37\" 4 1 30 11 4'47\" 5\" 5'5\" 6'35\" 14'35\" 16'5\" I","title":"LD!NGER : \"llA4 : a procedural calculus for intuitive reasonning","authors":"J F Rulifson, J A W Derksen~ R.O!","year":"1972","venue":"Tech. Note","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"!.R. SLAGlE : \"Automated Theorem proving for theories with simplifiers commutativity and assoc i ativity \" , J, ACM 21,4 (1974).","title":"Automated Theorem proving for theories with simplifiers commutativity and assoc i ativity","authors":"! R Slagle","year":"1974","venue":"J, ACM","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"M.E. STICKEL : \"A complete unification algorithm for as- sociative-commutative functions\". Proc. of the 4th IJCAI Tbilisi (1975).","title":"A complete unification algorithm for associative-commutative functions","authors":"M E Stickel","year":"1975","venue":"Proc. of the 4th IJCAI Tbilisi","doi":null,"url":null,"internal_url":"/proceedings/1975/12"},{"position":15,"raw":"M.E. STICKEL : \"Unification algorithms for artificial intelligence languages\" Ph.D. Carnegie ~ellon, Pittsburgh, Penn (197~).","title":"Unification algorithms for artificial intelligence languages","authors":"M E Stickel","year":null,"venue":null,"doi":null,"url":null,"internal_url":null},{"position":16,"raw":"M.F:. STICKEL & G. E. PETERSON: \"Complete sets of reduc- tions for equational theories 11 1J. of Arizone. Techn. Report ( 197a).","title":"Complete sets of reductions for equational theories 11 1","authors":"M, F : Stickel, G E Peterson","year":null,"venue":"J. of Arizone. Techn. Report","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"J. VU:LLEMIN : \"A data structure for manipulating prio- rity queues\" C. ACM Vol 21 (4)(1978).","title":"LLEMIN : \"A data structure for manipulating priority queues","authors":"J Vu","year":"1978","venue":"C. ACM","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"G. HUET : \"A unification Algorithm f o r typed ~-calculus\" 1 Theo. Com. Science I (1975).","title":"A unification Algorithm f o r typed ~-calculus\" 1 Theo","authors":"G Huet","year":"1975","venue":"Com. Science I","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"G. HUET: \"Resolution d'fquations dans les langages d'ordre 1,2,•••,w': Thhe d'Etat II. Paris VII ( 1976).","title":"Resolution d'fquations dans les langages d'ordre","authors":"G Huet","year":"1976","venue":null,"doi":null,"url":null,"internal_url":null},{"position":20,"raw":"M.,r. FAY : \"First order unification in equational theo- ries\"Tech. Report N-78-5-002 U. of C•lifornia ~\"nta-Cru z (1978).","title":"First order unification in equational theories","authors":"M Fay","year":"1978","venue":null,"doi":null,"url":null,"internal_url":null},{"position":21,"raw":"M.JFAY : \"First order unification in equational theories!' Fourth Workahop on automated deduction ~ustin Texaa(1979~","title":"First order unification in equational theories!' Fourth Workahop on automated deduction ~ustin Texaa","authors":"M Jfay","year":"1979","venue":null,"doi":null,"url":null,"internal_url":null},{"position":22,"raw":"D. LANKFORD : \"A unification algorithm for ahelian p,roup • theory\"Report MRP1. Dep. of !lath. Louisiana Tech. tJni.","title":"A unification algorithm for ahelian p,roup • theory","authors":"D Lankford","year":null,"venue":null,"doi":null,"url":null,"internal_url":null},{"position":23,"raw":"M. LIVESEr, .:. SIECY.MANN, P. SZABO, F. U/IVEPEf.HT : l'nifi:.. cation problems for combinations of associativity, com-• mutativity, distributivity and idempotence axioms. Fourth Workshop on automated deduction. Austin Texas Feb.(l979)","title":"l'nifi:.. cation problems for combinations of associativity, com-• mutativity, distributivity and idempotence axioms","authors":"M Liveser, . : Siecy, P Mann, F Szabo, Ivepef, Ht","year":null,"venue":"Fourth Workshop on automated deduction","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"J.M. HULLOT : \"Associative-cOII'allutative pattern matching\"' Report IRIA-LABORIA to appear (1979).","title":"Associative-cOII'allutative pattern matching","authors":"J M Hullot","year":"1979","venue":"Report IRIA-LABORIA to appear","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}