{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:30:22Z","timestamp":1752460222137},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1988,3,1]],"date-time":"1988-03-01T00:00:00Z","timestamp":573177600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":9269,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1988,3]]},"DOI":"10.1016\/0304-3975(88)90140-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:17:21Z","timestamp":1027657041000},"page":"345-353","source":"Crossref","is-referenced-by-count":22,"title":["Unification in commutative idempotent monoids"],"prefix":"10.1016","volume":"56","author":[{"given":"Franz","family":"Baader","sequence":"first","affiliation":[]},{"given":"Wolfram","family":"B\u00fcttner","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(88)90140-5_BIB1","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF02328451","article-title":"Unification in idempotent semigroups is of type zero","volume":"2","author":"Baader","year":"1986","journal-title":"J. Automated Reasoning"},{"key":"10.1016\/0304-3975(88)90140-5_BIB2","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF02575010","article-title":"Unification in varieties of idempotent semigroups","volume":"36","author":"Baader","year":"1987","journal-title":"Semigroup Forum"},{"key":"10.1016\/0304-3975(88)90140-5_BIB3","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF00246024","article-title":"Unification in the datastructure multisets","volume":"2","author":"B\u00fcttner","year":"1986","journal-title":"J. Automated Reasoning"},{"key":"10.1016\/0304-3975(88)90140-5_BIB4","series-title":"Proc. CADE-8","first-page":"470","article-title":"Unification in the datastructure sets","volume":"230","author":"B\u00fcttner","year":"1986"},{"key":"10.1016\/0304-3975(88)90140-5_BIB5","doi-asserted-by":"crossref","unstructured":"W. B\u00fcttner and H. Simonis, Embedding boolean expressions into logic programming, J. Symbolic Comput., to appear.","DOI":"10.1016\/S0747-7171(87)80065-2"},{"issue":"7","key":"10.1016\/0304-3975(88)90140-5_BIB6","article-title":"The algebraic theory of semigroups","volume":"1","author":"Clifford","year":"1981","journal-title":"Math. Surveys"},{"key":"10.1016\/0304-3975(88)90140-5_BIB7","series-title":"Proc. CADE-7","first-page":"194","article-title":"Associative-commutative unification","volume":"170","author":"Fages","year":"1984"},{"key":"10.1016\/0304-3975(88)90140-5_BIB8","first-page":"381","article-title":"An algebraic approach to unification under associativity and commutativity","author":"Fortenbacher","year":"1985","journal-title":"Proc. CRTA-85"},{"key":"10.1016\/0304-3975(88)90140-5_BIB9","series-title":"Seki-Research Report","article-title":"Unification in abelian semigroups","author":"Herold","year":"1985"},{"key":"10.1016\/0304-3975(88)90140-5_BIB10","series-title":"Tech. Rept.","article-title":"Unification of sets and multisets","author":"Liversey","year":"1976"},{"key":"10.1016\/0304-3975(88)90140-5_BIB11","first-page":"73","article-title":"Building in equational theories","volume":"7","author":"Plotkin","year":"1972","journal-title":"Machine Intelligence"},{"key":"10.1016\/0304-3975(88)90140-5_BIB12","series-title":"Proc. CADE-7","first-page":"1","article-title":"Universal unification","volume":"170","author":"Siekmann","year":"1984"},{"key":"10.1016\/0304-3975(88)90140-5_BIB13","series-title":"Informatik-Fachberichte","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-68826-3_9","article-title":"Universal unification","author":"Siekmann","year":"1982"},{"issue":"3","key":"10.1016\/0304-3975(88)90140-5_BIB14","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1145\/322261.322262","article-title":"A unification algorithm for associative commutative functions","volume":"28","author":"Stickel","year":"1981","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(88)90140-5_BIB15","series-title":"Ph.D. Thesis","article-title":"First-order unification in combinations of equational theories","author":"Tid\u00e9n","year":"1986"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588901405?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397588901405?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T13:56:00Z","timestamp":1555077360000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397588901405"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988,3]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1988,3]]}},"alternative-id":["0304397588901405"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(88)90140-5","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1988,3]]}}}