{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:12:36Z","timestamp":1725664356059},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540592006"},{"type":"electronic","value":"9783540492238"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59200-8_70","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:05:56Z","timestamp":1330275956000},"page":"367-381","source":"Crossref","is-referenced-by-count":1,"title":["Some independence results for equational unification"],"prefix":"10.1007","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":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"29_CR1","first-page":"1","volume-title":"Formal Techniques in Artificial Intelligence","author":"J. Avenhaus","year":"1990","unstructured":"Avenhaus, J., and K. Madlener, \u201cTerm Rewriting and Equational Reasoning,\u201d in: R.B. Banerji (ed.), Formal Techniques in Artificial Intelligence, North-Holland, Amsterdam, 1990, pp. 1\u201343."},{"key":"29_CR2","volume-title":"Handbook of Logic in Artificial Intelligence and Logic Programming","author":"F. Baader","year":"1993","unstructured":"Baader, F., and J. Siekmann, \u201cUnification Theory,\u201d in: D.M. Gabbay, C.J. Hogger and J.A. Robinson (eds.), Handbook of Logic in Artificial Intelligence and Logic Programming, Oxford University Press, Oxford, UK, 1993."},{"key":"29_CR3","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-9771-7","volume-title":"String-Rewriting Systems","author":"R.V. Book","year":"1993","unstructured":"Book, R.V., and F. Otto, String-Rewriting Systems, Springer: New York, 1993."},{"key":"29_CR4","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1016\/S0747-7171(89)80057-4","volume":"8","author":"H.-J. B\u00fcrckert","year":"1989","unstructured":"B\u00fcrckert, H.-J., \u201cMatching-a special case of unification?\u201d Journal of Symbolic Computation 8 (1989) 523\u2013536.","journal-title":"Journal of Symbolic Computation"},{"key":"29_CR5","first-page":"243","volume-title":"Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics","author":"N. Dershowitz","year":"1990","unstructured":"Dershowitz, N., and J.P. Jouannaud, \u201cRewrite Systems,\u201d in: J. van Leeuwen (ed.), Handbook of Theoretical Computer Science, Vol. B: Formal Models and Semantics, Elsevier, Amsterdam, 1990, pp. 243\u2013320."},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/0168-0072(88)90015-2","volume":"39","author":"W.M. Farmer","year":"1988","unstructured":"Farmer, W.M., \u201cA unification algorithm for second-order monadic terms,\u201d Annals of Pure and Applied Logic 39 (1988) 131\u2013174.","journal-title":"Annals of Pure and Applied Logic"},{"key":"29_CR7","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0304-3975(81)90040-2","volume":"13","author":"W.D. Goldfarb","year":"1981","unstructured":"Goldfarb, W.D., \u201cThe undecidability of the second-order unification problem,\u201d Theoretical Computer Science 13 (1981) 225\u2013230.","journal-title":"Theoretical Computer Science"},{"key":"29_CR8","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1070\/SM1977v032n02ABEH002376","volume":"32","author":"G.S. Makanin","year":"1977","unstructured":"Makanin, G.S., \u201cThe problem of solvability of equations in a free semigroup,\u201d Math. USSR Sbornik 32 (1977) 129\u2013198.","journal-title":"Math. USSR Sbornik"},{"key":"29_CR9","first-page":"276","volume-title":"Proceedings, Lecture Notes in Artificial Intelligence 449","author":"P. Narendran","year":"1990","unstructured":"Narendran, P., and F. Otto, \u201cSome results on equational unification,\u201d in: M. Stickel (ed.), 10th Int. Conf. on Automated Deduction, Proceedings, Lecture Notes in Artificial Intelligence 449, Springer, Berlin, 1990, pp. 276\u2013291."},{"key":"29_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"},{"doi-asserted-by":"crossref","unstructured":"Otto, F., \u201cSolvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general,\u201d Information Processing Letters, to appear.","key":"29_CR11","DOI":"10.1016\/0020-0190(94)00208-G"},{"unstructured":"Otto, F., The 2\nnd-tOrder E-Unification Problem for Finite Monadic String-Rewriting Systems, in preparation.","key":"29_CR12"},{"key":"29_CR13","volume-title":"Th\u00e8se 3e Cycle","author":"J.-P. P\u00e9cuchet","year":"1981","unstructured":"P\u00e9cuchet, J.-P., Equations avec Constantes et Algorithme de Makanin, Th\u00e8se 3e Cycle, Universit\u00e9 de Rouen, France, 1981."},{"key":"29_CR14","series-title":"Proceedings, Lecture Notes in Computer Science 572","first-page":"85","volume-title":"Word Equations and Related Topics","author":"K.U. Schulz","year":"1990","unstructured":"Schulz, K.U., \u201cMakanin's Algorithm for Word Equations-Two Improvements and a Generalization,\u201d in: K.U. Schulz (ed.), Word Equations and Related Topics, Proceedings, Lecture Notes in Computer Science 572, Springer, Berlin, 1990, pp. 85\u2013150."}],"container-title":["Lecture Notes in Computer Science","Rewriting Techniques and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59200-8_70.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T01:25:04Z","timestamp":1619573104000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59200-8_70"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540592006","9783540492238"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-59200-8_70","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}