{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,28]],"date-time":"2026-07-28T01:30:38Z","timestamp":1785202238345,"version":"3.55.0"},"reference-count":20,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1989,7,1]],"date-time":"1989-07-01T00:00:00Z","timestamp":615254400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1989,7,1]],"date-time":"1989-07-01T00:00:00Z","timestamp":615254400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2009,5,27]],"date-time":"2009-05-27T00:00:00Z","timestamp":1243382400000},"content-version":"vor","delay-in-days":7270,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Symbolic Computation"],"published-print":{"date-parts":[[1989,7]]},"DOI":"10.1016\/s0747-7171(89)80026-4","type":"journal-article","created":{"date-parts":[[2008,5,28]],"date-time":"2008-05-28T17:39:00Z","timestamp":1211996340000},"page":"217-240","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":16,"title":["Adventures in associative-commutative unification"],"prefix":"10.1016","volume":"8","author":[{"given":"Patrick","family":"Lincoln","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jim","family":"Christian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0747-7171(89)80026-4_bib1","first-page":"417","article-title":"\u201cComplexity of Matching Problems\u201d Rewriting Techniques and Applications","volume":"Vol. 202","author":"Bananev","year":"1985"},{"key":"10.1016\/S0747-7171(89)80026-4_bib2","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF00246024","article-title":"Unification in Datastructure Multisets","volume":"2","author":"B\u00fcttner","year":"1986","journal-title":"Journal of Automated Reasoning"},{"issue":"Number 3","key":"10.1016\/S0747-7171(89)80026-4_bib3","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/S0747-7171(87)80004-4","article-title":"Associative-Commutative Unification","volume":"Vol. 3","author":"Fages","year":"1987","journal-title":"Journal of Symbolic Computation"},{"key":"10.1016\/S0747-7171(89)80026-4_bib4","series-title":"Rewriting Techniques and Applications","first-page":"381","article-title":"An Algebraic Approach to Unification Under Associativity and Communtativity","volume":"Vol. 202","author":"Fortenbacher","year":"1985"},{"key":"10.1016\/S0747-7171(89)80026-4_bib5","first-page":"23","article-title":"Ueber die Aufl\u00f6sung linearer Gleichungen mit reelen Coefficienten","author":"Gordan","year":"1873","journal-title":"Mathermatische Annalen VI Band, 1 Heft"},{"key":"10.1016\/S0747-7171(89)80026-4_bib6","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/BF00243791","article-title":"Unification in Abelian Semigroups","volume":"3","author":"Herold","year":"1987","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/S0747-7171(89)80026-4_bib7","article-title":"An Algorithm to Generate the Basis of Solutions to Homogeneous Linear Diophantine Equations","author":"Huet","year":"1978","journal-title":"IRIA Research Report No. 274"},{"key":"10.1016\/S0747-7171(89)80026-4_bib8","series-title":"Formal Languages: Perspectives and Open Problems","article-title":"Equations and Rewrite Rules: a Survey","author":"Huet","year":"1980"},{"key":"10.1016\/S0747-7171(89)80026-4_bib9","first-page":"406","article-title":"Associative commutative Pattern Matching","volume":"Volume One","author":"Hullot","year":"1979"},{"key":"10.1016\/S0747-7171(89)80026-4_bib10","series-title":"Proc. of the Eighth Conference on Automated Deduction","first-page":"691","article-title":"RRL: A Rewrite Rule Laboratory","volume":"Vol. 230","author":"Kapur","year":"1986"},{"key":"10.1016\/S0747-7171(89)80026-4_bib11","series-title":"Proc. Colloquium on the Resolution of Equations in Algebraic Structures","article-title":"Methods and Tools for Equational Unification","author":"Kirchner","year":"1987"},{"key":"10.1016\/S0747-7171(89)80026-4_bib12","series-title":"New Non-negative Integer Basis Algorithms for Linear Equations with Integer Coefficients","author":"Lankford","year":"1987"},{"key":"10.1016\/S0747-7171(89)80026-4_bib13","article-title":"Unification of A+C-terms (bags) and A+C+I-terms (sets)","author":"Livesey","year":"1976"},{"issue":"2","key":"10.1016\/S0747-7171(89)80026-4_bib14","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1145\/357162.357169","article-title":"An Efficient Unification Algorithm","volume":"4","author":"Martelli","year":"1982","journal-title":"ACM Transactions on Programming Languages and Systems"},{"key":"10.1016\/S0747-7171(89)80026-4_bib15","series-title":"Proc Principles of Database Systems","article-title":"Rewriting of Rules Containing Set Terms in a Logic Data, Language","author":"Shmueli","year":"1988"},{"key":"10.1016\/S0747-7171(89)80026-4_bib16","series-title":"Proc. of the Seventh Conference on Automated Deduction","first-page":"1","article-title":"Universal Unification","volume":"Vol. 170","author":"Siekmann","year":"1984"},{"key":"10.1016\/S0747-7171(89)80026-4_bib17","series-title":"Proc. 4th International Joint Conference on Artificial Intelligence","first-page":"71","article-title":"A Complete Unification Algorithm for Associative-Commutative Functions","author":"Stickel","year":"1975"},{"issue":"No. 3","key":"10.1016\/S0747-7171(89)80026-4_bib18","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1145\/322261.322262","article-title":"A Unification Algorithm for Associative-Commutative Fucntions","volume":"Vol. 28","author":"Stickel","year":"1981","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0747-7171(89)80026-4_bib19","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF00243792","article-title":"A Comparison of the Variable-Abstration and Constant-Abstraction methods for Associative-Commutative Unification","volume":"3","author":"Stickel","year":"1987","journal-title":"Journal of Automated Reasoning"},{"key":"10.1016\/S0747-7171(89)80026-4_bib20","article-title":"An Efficient Algorithm for Simple Diophantine Equations","author":"Zhang","year":"1987"}],"container-title":["Journal of Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717189800264?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0747717189800264?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T10:41:05Z","timestamp":1734086465000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0747717189800264"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,7]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1989,7]]}},"alternative-id":["S0747717189800264"],"URL":"https:\/\/doi.org\/10.1016\/s0747-7171(89)80026-4","relation":{},"ISSN":["0747-7171"],"issn-type":[{"value":"0747-7171","type":"print"}],"subject":[],"published":{"date-parts":[[1989,7]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Adventures in associative-commutative unification","name":"articletitle","label":"Article Title"},{"value":"Journal of Symbolic Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0747-7171(89)80026-4","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1989 Published by Elsevier Ltd.","name":"copyright","label":"Copyright"}]}}