{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T09:52:06Z","timestamp":1713433926420},"reference-count":20,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,5,1]],"date-time":"1998-05-01T00:00:00Z","timestamp":893980800000},"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":5556,"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":[[1998,5]]},"DOI":"10.1016\/s0304-3975(97)00130-8","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"1-47","source":"Crossref","is-referenced-by-count":1,"title":["Equational unification, word unification, and 2nd-order equational unification"],"prefix":"10.1016","volume":"198","author":[{"given":"Friedrich","family":"Otto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paliath","family":"Narendran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel J.","family":"Dougherty","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00130-8_BIB1","series-title":"Formal Techniques in Artificial Intelligence","first-page":"1","article-title":"Term rewriting and equational reasoning","author":"Avenhaus","year":"1990"},{"key":"10.1016\/S0304-3975(97)00130-8_BIB2","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1006\/jsco.1996.0009","article-title":"Unification in the union of disjoint equational theories: combining decision procedures","volume":"21","author":"Baader","year":"1996","journal-title":"J. Symbol. Comput."},{"key":"10.1016\/S0304-3975(97)00130-8_BIB3","first-page":"41","article-title":"Unification Theory","author":"Baader","year":"1994"},{"key":"10.1016\/S0304-3975(97)00130-8_BIB4","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1016\/0304-3975(83)90005-1","article-title":"Decidable sentences of Church-Rosser congruences","volume":"24","author":"Book","year":"1983","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00130-8_BIB5","series-title":"String-Rewriting Systems","author":"Book","year":"1993"},{"key":"10.1016\/S0304-3975(97)00130-8_BIB6","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1016\/S0747-7171(89)80057-4","article-title":"Matching \u2014 a special case of unification?","volume":"8","author":"B\u00fcrckert","year":"1989","journal-title":"J. Symbol. Comput."},{"key":"10.1016\/S0304-3975(97)00130-8_BIB7","series-title":"Formal Models and Semantics","first-page":"243","article-title":"Rewrite Systems","volume":"Vol. B","author":"Dershowitz","year":"1990"},{"key":"10.1016\/S0304-3975(97)00130-8_BIB8","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0168-0072(88)90015-2","article-title":"A unification algorithm for second-order monadic terms","volume":"39","author":"Farmer","year":"1988","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(97)00130-8_BIB9","series-title":"A Guide to the Theory of NP-Completeness","article-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0304-3975(97)00130-8_BIB10","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0304-3975(81)90040-2","article-title":"The undecidability of the second-order unification problem","volume":"13","author":"Goldfarb","year":"1981","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00130-8_BIB11","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1070\/SM1977v032n02ABEH002376","article-title":"The problem of solvability of equations in a free semigroup","volume":"32","author":"Makanin","year":"1977","journal-title":"Math. USSR Sbornik"},{"key":"10.1016\/S0304-3975(97)00130-8_BIB12","series-title":"10th Int. Conf. on Automated Deduction, Proceedings","first-page":"276","article-title":"Some results on equational unification","volume":"vol. 449","author":"Narendran","year":"1990"},{"key":"10.1016\/S0304-3975(97)00130-8_BIB13","series-title":"Automata, Languages, and Programming, Proc. ICALP'97","article-title":"The word matching problem is undecidable for finite special string-rewriting systems that are confluent","volume":"vol. 1256","author":"Narendran","year":"1997"},{"key":"10.1016\/S0304-3975(97)00130-8_BIB14","first-page":"331","article-title":"On two problems related to cancellativity","volume":"33","author":"Otto","year":"1986"},{"key":"10.1016\/S0304-3975(97)00130-8_BIB15","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0020-0190(94)00208-G","article-title":"Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general","volume":"53","author":"Otto","year":"1995","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(97)00130-8_BIB16","series-title":"Rewriting Techniques and Applications, Proceedings","first-page":"367","article-title":"Some independence results for equational unification","volume":"vol. 914","author":"Otto","year":"1995"},{"key":"10.1016\/S0304-3975(97)00130-8_BIB17","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/0022-0000(78)90043-0","article-title":"Linear unification","volume":"16","author":"Paterson","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(97)00130-8_BIB18","article-title":"Equations avec Constantes et Algorithme de Makanin","author":"P\u00e9cuchet","year":"1981"},{"key":"10.1016\/S0304-3975(97)00130-8_BIB19","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","article-title":"A machine oriented logic based on the resolution principle","volume":"12","author":"Robinson","year":"1965","journal-title":"J. Assoc. Comput. Machinery"},{"key":"10.1016\/S0304-3975(97)00130-8_BIB20","series-title":"Word Equations and Related Topics, Proceedings","first-page":"85","article-title":"Makanin's algorithm for word equations \u2014 two improvements and a generalization","volume":"vol. 572","author":"Schulz","year":"1990"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597001308?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597001308?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,16]],"date-time":"2019-04-16T13:01:01Z","timestamp":1555419661000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597001308"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":20,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["S0304397597001308"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00130-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}