{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T15:45:42Z","timestamp":1775058342973,"version":"3.50.1"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Autom Reasoning"],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/bf00881904","type":"journal-article","created":{"date-parts":[[2004,12,27]],"date-time":"2004-12-27T07:37:28Z","timestamp":1104133048000},"page":"149-184","source":"Crossref","is-referenced-by-count":27,"title":["Word unification and transformation of generalized equations"],"prefix":"10.1007","volume":"11","author":[{"given":"Klaus U.","family":"Schulz","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","volume-title":"R\u00e9solution d'\u00e9quations sur les mots: Etude et impl\u00e9mentation LISP de l'algorithme de Makanin","author":"H. Abdulrab","year":"1987","unstructured":"Abdulrab, H., ?R\u00e9solution d'\u00e9quations sur les mots: Etude et impl\u00e9mentation LISP de l'algorithme de Makanin?, Th\u00e8se de doctorat, Laboratoire d'informatique, Rouen, 1987."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1016\/S0747-7171(89)80056-2","volume":"8","author":"H. Abdulrab","year":"1989","unstructured":"Abdulrab H. and P\u00e9cuchet, J.-P., ?Solving word equations?,J. Symbolic Computation,8, 499?521 (1989).","journal-title":"J. Symbolic Computation"},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"Aho, A. V., ?Agorithms for finding patterns in strings?, inHandbook of Theoretical Computer Science (J. van Leeuwen, ed.), Elsevier Science Publishers, pp. 256?300, 1990.","DOI":"10.1016\/B978-0-444-88071-0.50010-2"},{"key":"CR4","series-title":"LNCS","volume-title":"Proceedings First International Workshop on Word Equations and Related Topics, IWWERT '90","author":"F. Baader","year":"1990","unstructured":"Baader, F., ?Unification theory?,Proceedings First International Workshop on Word Equations and Related Topics, IWWERT '90 (K. U. Schulz, ed.), T\u00fcbingen, Springer,LNCS 572, 1990."},{"key":"CR5","unstructured":"Bulitko, V. K., ?Equations and inequalities in a free group and a free semigroup?,Tul. Gos. Ped. Inst. U?en. Zap. Mat. Kafedr Vyp. 2, Geometr. i Algebra 242?252, 1970 (Russian) (MR52# 14045)."},{"key":"CR6","unstructured":"Colmerauer, A., ?Final specification for Prolog III?,ESPRIT Ref. No. P1219 1106, 1988."},{"key":"CR7","first-page":"82","volume":"7","author":"D. C. Cooper","year":"1972","unstructured":"Cooper, D. C., ?Theorem proving in arithmetic without multiplic\u00e0tion?,Machine Intelligence,7, 82?95 (1972).","journal-title":"Machine Intelligence"},{"key":"#cr-split#-CR8.1","unstructured":"Hmelevskii, J. I., ?Equations in free semigroups?,Trudy Mat. Inst. Steklov,107 (1971);"},{"key":"#cr-split#-CR8.2","unstructured":"English translation:Proc. Steklov Inst. of Mathematics,107 (1971)."},{"issue":"1","key":"CR9","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/78935.78938","volume":"37","author":"J. Jaffar","year":"1990","unstructured":"Jaffar, J., ?Minimal and complete word unification?,J. ACM,37(1), 47?85 (1990).","journal-title":"J. ACM"},{"key":"CR10","unstructured":"Ko?cielski, A. and Pacholski, L., ?Complexity of Makanin's algorithms?,Research Report, University of Wroclaw (1991); preliminary version: ?Complexity of unification in free groups and free semigroups?,Proceedings 31st Annual IEEE Symposium on Foundations of Computer Science, Los Alamos, pp. 824?829, 1990."},{"key":"CR11","first-page":"67","volume-title":"Automata Languages and Programming","author":"A. Lentin","year":"1972","unstructured":"Lentin, A., ?Equations in free monoids?, inAutomata Languages and Programming (M. Nivat, ed.), North Holland Publishers, Amsterdam, pp. 67?85, 1972."},{"key":"CR12","unstructured":"Lentin, A. and Sch\u00fctzenberger, M. P., ?A combinatorial problem in the theory of free monoids?, inProceedings of the University of North Carolina, 128?144 (1967)."},{"key":"CR13","unstructured":"Livesey, M. and Siekmann, J., ?Termination and decidability results for string unification?, Research paper, Essex University, 1975."},{"issue":"2","key":"CR14","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1070\/SM1977v032n02ABEH002376","volume":"32","author":"G. S. Makanin","year":"1977","unstructured":"Makanin, G. S., ?The problem of solvability of equations in a free semigroup?,Math. USSR Sbornik 32(2), 129?198 (1977).","journal-title":"Math. USSR Sbornik"},{"issue":"3","key":"CR15","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1070\/IM1980v014n03ABEH001143","volume":"14","author":"G. S. Makanin","year":"1980","unstructured":"Makanin, G. S., ?Recognition of the rank of equations in a free semigroup?,Math. USSR Izvestija 14(3), 499?545 (1980).","journal-title":"Math. USSR Izvestija"},{"issue":"2","key":"CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/trans2\/117\/01","volume":"117","author":"G. S. Makanin","year":"1981","unstructured":"Makanin, G. S., ?Equations in a free semigroup?,Amer. Math. Soc. Transl. (2),117, 1?6 (1981).","journal-title":"Amer. Math. Soc. Transl."},{"key":"CR17","volume-title":"Equations avec constantes et algorithme de Makanin","author":"J. P. P\u00e9cuchet","year":"1981","unstructured":"P\u00e9cuchet, J. P., ?Equations avec constantes et algorithme de Makanin?, Th\u00e8se de doctorat, Laboratoire d'informatique, Rouen, 1981."},{"key":"CR18","first-page":"73","volume":"7","author":"G. Plotkin","year":"1972","unstructured":"Plotkin, G., ?Building-in equational theories?,Machine Intelligence 7, 73?90 (1972).","journal-title":"Machine Intelligence"},{"key":"CR19","unstructured":"Schulz, K. U., ?Makanin's algorithm ? two improvements and a generalization?, Habilitationsschrift,CIS-Report 91-39, University of Munich. Also inProceedings of the First International Workshop on Word Equations and Related Topics, IWWERT '90, T\u00fcbingen, Springer,LNCS 572, 1990."},{"key":"CR20","unstructured":"Siekmann, J., ?String-unification?,Research Paper, Essex University, March, 1975."},{"key":"CR21","unstructured":"Siekmann, J., ?Unification and matching problems?,Ph.D. Thesis, Essex University, Memo CSA-4-78, 1978."},{"key":"CR22","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/S0747-7171(89)80012-4","volume":"7","author":"J. Siekmann","year":"1989","unstructured":"Siekmann, J., ?Unification theory: A survey?, in Special Issue on Unification,Journal of Symbolic Computation (C. Kirchner, ed.),7, 315?337 (1989).","journal-title":"Journal of Symbolic Computation"}],"container-title":["Journal of Automated Reasoning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00881904.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00881904\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00881904","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,4]],"date-time":"2020-04-04T23:54:03Z","timestamp":1586044443000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00881904"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993]]}},"alternative-id":["BF00881904"],"URL":"https:\/\/doi.org\/10.1007\/bf00881904","relation":{},"ISSN":["0168-7433","1573-0670"],"issn-type":[{"value":"0168-7433","type":"print"},{"value":"1573-0670","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993]]}}}