{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T03:53:36Z","timestamp":1781927616792,"version":"3.54.5"},"reference-count":25,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1995,5,1]],"date-time":"1995-05-01T00:00:00Z","timestamp":799286400000},"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":6652,"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":[[1995,5]]},"DOI":"10.1016\/0304-3975(94)00277-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:07:16Z","timestamp":1027652836000},"page":"229-255","source":"Crossref","is-referenced-by-count":19,"title":["Combination techniques and decision problems for disunification"],"prefix":"10.1016","volume":"142","author":[{"given":"Franz","family":"Baader","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Klaus U.","family":"Schulz","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)00277-0_BIB1_1","unstructured":"a F. Baader and K.U. Schulz, General A- and AX-unification via optimized combination procedures, CIS-Report 92-58, CIS, University Munich"},{"key":"10.1016\/0304-3975(94)00277-0_BIB1_2","article-title":"General A- and AX-unification via optimized combination procedures","volume":"607","author":"Baader","year":"1991"},{"key":"10.1016\/0304-3975(94)00277-0_BIB2_1","unstructured":"a F. Baader and K.U. Schulz, Unification in the union of disjoint equational theories: combining decision procedures, DFKI-Research Report RR-91-33"},{"key":"10.1016\/0304-3975(94)00277-0_BIB2_2","first-page":"50","article-title":"Unification in the union of disjoint equational theories: combining decision procedures","volume":"607","author":"Baader","year":"1992"},{"key":"10.1016\/0304-3975(94)00277-0_BIB3","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF02017493","article-title":"Coding in the existential theory of concatenation","volume":"26","author":"B\u00fcchi","year":"1986","journal-title":"Arch. math. Logic"},{"key":"10.1016\/0304-3975(94)00277-0_BIB4","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1145\/179812.179813","article-title":"On solving equations and disequations","volume":"41","author":"Buntine","year":"1994","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0304-3975(94)00277-0_BIB5","article-title":"Solving disequations in equational theories","volume":"310","author":"B\u00fcrckert","year":"1988"},{"key":"10.1016\/0304-3975(94)00277-0_BIB6","article-title":"A resolution principle for clauses with constraints","volume":"449","author":"B\u00fcrckert","year":"1990"},{"key":"10.1016\/0304-3975(94)00277-0_BIB7","unstructured":"A. Colmerauer, Equations and inequations on finite and infinite trees, in Proc. FGCS'84, 85\u201399."},{"key":"10.1016\/0304-3975(94)00277-0_BIB8","doi-asserted-by":"crossref","DOI":"10.1145\/79204.79210","article-title":"An introduction to PROLOG III","volume":"33","author":"Colmerauer","year":"1990","journal-title":"C. ACM"},{"key":"10.1016\/0304-3975(94)00277-0_BIB9","article-title":"Unification et Disunification. Th\u00e9orie et Applications","author":"Comon","year":"1988"},{"key":"10.1016\/0304-3975(94)00277-0_BIB10","article-title":"Disunification: a survey","author":"Comon","year":"1991"},{"key":"10.1016\/0304-3975(94)00277-0_BIB11","first-page":"151","article-title":"The complexity of theorem-proving procedures","author":"Cook","year":"1971"},{"key":"10.1016\/0304-3975(94)00277-0_BIB12_1","article-title":"Rewrite systems, Unit\u00e9 Associ\u00e9e au CNRS UA 410: AL KHOWARIZMI","author":"Dershowitz","year":"1989","journal-title":"Rapport de Recherche no 478"},{"key":"10.1016\/0304-3975(94)00277-0_BIB12_2","article-title":"Rewrite systems, Unit\u00e9 Associ\u00e9e au CNRS UA 410: AL KHOWARIZMI","volume":"B","author":"Dershowitz","year":"1990"},{"key":"10.1016\/0304-3975(94)00277-0_BIB13","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/mana.19710480118","article-title":"All varieties of bands I, II","volume":"48","author":"Fennemore","year":"1971","journal-title":"Math. Nachr."},{"key":"10.1016\/0304-3975(94)00277-0_BIB14","article-title":"Constraint logic programming","author":"Jaffar","year":"1987","journal-title":"Proc. 14th POPL Conf."},{"key":"10.1016\/0304-3975(94)00277-0_BIB15","article-title":"Solving equations in abstract algebras: a rule-based survey of unification","author":"Jouannaud","year":"1991"},{"key":"10.1016\/0304-3975(94)00277-0_BIB16","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF00245463","article-title":"Complexity of unification problems with associative-commutative operators","volume":"9","author":"Kapur","year":"1992","journal-title":"J. Automat. Reason."},{"key":"10.1016\/0304-3975(94)00277-0_BIB17","article-title":"Double exponential complexity of computing complete set of AC-unifiers","author":"Kapur","year":"1992","journal-title":"Proc. 7th Ann. IEEE Symp. on Logic in Computer Science"},{"key":"10.1016\/0304-3975(94)00277-0_BIB18","doi-asserted-by":"crossref","DOI":"10.1145\/74540.74585","article-title":"Constrained equational reasoning","author":"Kirchner","year":"1989"},{"key":"10.1016\/0304-3975(94)00277-0_BIB19","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1145\/357073.357079","article-title":"Simplification by cooperating decision procedures","volume":"1","author":"Nelson","year":"1979","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"10.1016\/0304-3975(94)00277-0_BIB20","article-title":"Combination of unification algorithms","volume":"8","author":"Schmidt-Schau\u00df","year":"1989","journal-title":"J. Symbolic Comput."},{"key":"10.1016\/0304-3975(94)00277-0_BIB21","author":"Schrijver","year":"1986"},{"key":"10.1016\/0304-3975(94)00277-0_BIB22","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1016\/0747-7171(92)90016-W","article-title":"A new method for undecidability proofs of first order theories","volume":"14","author":"Treinen","year":"1992","journal-title":"J. Symbolic Comput."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594002770?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594002770?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T22:25:36Z","timestamp":1555194336000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594002770"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,5]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,5]]}},"alternative-id":["0304397594002770"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)00277-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1995,5]]}}}