{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:55:05Z","timestamp":1725663305249},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540528852"},{"type":"electronic","value":"9783540471714"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1990]]},"DOI":"10.1007\/3-540-52885-7_94","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:44:43Z","timestamp":1330206283000},"page":"276-291","source":"Crossref","is-referenced-by-count":4,"title":["Some results on equational unification"],"prefix":"10.1007","author":[{"given":"Paliath","family":"Narendran","sequence":"first","affiliation":[]},{"given":"Friedrich","family":"Otto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"20_CR1","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/S0747-7171(87)80027-5","volume":"3","author":"D. Benanav","year":"1987","unstructured":"Benanav, D., D. Kapur, and P. Narendran, \u201cComplexity of Matching Problems,\u201d In: Proceedings of RTA-85, Dijon, France. A revised version appears in Journal of Symbolic Computation 3 (1987) 203\u2013216.","journal-title":"Journal of Symbolic Computation"},{"key":"20_CR2","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1145\/322290.322301","volume":"29","author":"R.V. Book","year":"1982","unstructured":"Book, R.V., \u201cConfluent and other types of Thue systems,\u201d Journal of the ACM 29 (1982), 171\u2013182.","journal-title":"Journal of the ACM"},{"key":"20_CR3","first-page":"216","volume":"118","author":"R.V. Book","year":"1981","unstructured":"Book, R.V., M. Jantzen, B. Monien, C. \u00d3'D\u00fanlaing, and C. Wrathall, \u201cOn the Complexity of Word Problems in certain Thue systems,\u201d Mathematical Foundations of Computer Science, LNCS 118 (1981) 216\u2013223.","journal-title":"LNCS"},{"key":"20_CR4","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/S0747-7171(89)80021-5","volume":"8","author":"H.-J. B\u00fcrckert","year":"1989","unstructured":"B\u00fcrckert, H.-J., A. Herold, and M. Schmidt-Schauss, \u201cOn Equational Theories, Unification, and (Un)Decidability,\u201d J. of Symbolic Computation 8 (1989) 3\u201349.","journal-title":"J. of Symbolic Computation"},{"key":"20_CR5","unstructured":"Fages, F., \u201cAssociative-Communtative Unification,\u201d In: Proceedings of 7th Conference on Automated Deduction (CADE-84), Napa Valley, California."},{"key":"20_CR6","doi-asserted-by":"crossref","unstructured":"Fortenbacher, A., \u201cAn Algebraic Approach to Unification under Associativity and Commutativity,\u201d In: Proceedings of RTA-85, Dijon, France.","DOI":"10.1007\/3-540-15976-2_19"},{"key":"20_CR7","unstructured":"Hopcroft, J.E., and J.D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, 1979."},{"key":"20_CR8","volume-title":"Formal Languages: Perspectives and Open Problems","author":"G. Huet","year":"1980","unstructured":"Huet, G., and D. Oppen, \u201cEquations and Rewrite Rules: a survey,\u201d in Formal Languages: Perspectives and Open Problems (R. Book, ed.), Academic Press, New York, 1980."},{"key":"20_CR9","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0304-3975(84)90090-2","volume":"33","author":"F. Otto","year":"1984","unstructured":"Otto, F., \u201cSome Undecidability Results for Non-Monadic Church-Rosser Thue systems,\u201d Theoretical Computer Science 33 (1984) 261\u2013278.","journal-title":"Theoretical Computer Science"},{"key":"20_CR10","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF02573208","volume":"33","author":"F. Otto","year":"1986","unstructured":"Otto, F., \u201cOn Two Problems Related to Cancellativity,\u201d Semigroup Forum 33 (1986), 331\u2013356.","journal-title":"Semigroup Forum"},{"key":"20_CR11","unstructured":"Schmidt-Schauss, M.J., \u201cTwo Problems in Unification Theory,\u201d Bulletin of the EATCS 34 (Feb '88) p. 273."},{"key":"20_CR12","first-page":"1","volume":"170","author":"J.H. Siekmann","year":"1984","unstructured":"Siekmann, J.H., \u201cUniversal Unification,\u201d In: Proceedings of CADE-7, Napa Valley, CA, LNCS 170 (1984) 1\u201342.","journal-title":"LNCS"},{"key":"20_CR13","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0747-7171(89)80012-4","volume":"7","author":"J.H. Siekmann","year":"1989","unstructured":"Siekmann, J.H., \u201cUnification Theory,\u201d Journal of Symbolic Computation 7 (1989) 207\u2013274.","journal-title":"Journal of Symbolic Computation"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Stickel, M.E., \u201cA Unification Algorithm for Associative-Commutative Functions,\u201d Journal of the ACM 28, 423\u2013434.","DOI":"10.1145\/322261.322262"}],"container-title":["Lecture Notes in Computer Science","10th International Conference on Automated Deduction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-52885-7_94.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:25:40Z","timestamp":1605648340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-52885-7_94"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990]]},"ISBN":["9783540528852","9783540471714"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-52885-7_94","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1990]]}}}