{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,7]],"date-time":"2025-08-07T08:59:35Z","timestamp":1754557175517,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540631040"},{"type":"electronic","value":"9783540691402"}],"license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63104-6_4","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:04:49Z","timestamp":1330297489000},"page":"34-48","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["On equality up-to constraints over finite trees, context unification, and one-step rewriting"],"prefix":"10.1007","author":[{"given":"Joachim","family":"Niehren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manfred","family":"Pinkal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Ruhrberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"F. Baader and K. Schulz. Unification in the union of disjoint equational theories. Int. Conferece on Automated Deduction, volume 607 of LNCS, pages 50\u201365. 1992.","DOI":"10.1007\/3-540-55602-8_155"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"F. Baader and J. Siekmann. Handbook of Logic in Artificial Intelligence and Logic Programming, chapter Unification Theory. Oxford University Press, 1993.","DOI":"10.1093\/oso\/9780198537465.003.0002"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"A. Caron, J.-L. Coquide, and M. Dauchet. Encompassment properties and automata with constraints. Int. Conference on Rewriting Techniques and Applications, volume 690 of LNCS, pages 328\u2013342. 1993.","DOI":"10.1007\/3-540-56868-9_25"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"H. Comon. Completion of rewrite systems with membership constraints. Int. Coll. on Automata, Languages and Programming, volume 623 of LNCS, 1992.","DOI":"10.1007\/3-540-55719-9_91"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF00630923","volume":"14","author":"M. Dalrymple","year":"1991","unstructured":"M. Dalrymple, S. Shieber, and F. Pereira. Ellipsis and higher order unification. Linguistics and Philosophy, 14:399\u2013452, 1991.","journal-title":"Linguistics and Philosophy"},{"key":"4_CR6","doi-asserted-by":"crossref","unstructured":"C. Gardent, and M. Kohlhase. Higher-order coloured unification and natural language semantics. Annual meeting of the ACL, 1996.","DOI":"10.3115\/981863.981864"},{"key":"4_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":"W. D. Goldfarb. The undecidability of the second-order unification problem. Theoretical Computer Science, 13:225\u2013230, 1981.","journal-title":"Theoretical Computer Science"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0304-3975(75)90011-0","volume":"1","author":"G. Huet","year":"1975","unstructured":"G. Huet. A unification algorithm for typed \u03bb-calculus. Theoretical Computer Science, 1:27\u201357, 1975.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"4_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1145\/78935.78938","volume":"37","author":"J. Jaffar","year":"1990","unstructured":"J. Jaffar. Minimal and complete word unification. J. of the ACM, 37(1):47\u201385, 1990.","journal-title":"J. of the ACM"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"A. Ko\u015bcielski and L. Pacholski. Complexity of makanin's algorithm. Journal of the ACM, 43(4), 1996.","DOI":"10.1145\/234533.234543"},{"key":"4_CR11","unstructured":"A. Lentin and M. Sch\u00fctzenberger. A combinatorial problem in the theory of free monoids. Conference on Combinatorical Mathematics and its Applications, 1969."},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"J. L\u00e9vy. Linear second order unification. Int. Conference on Rewriting Techniques and Applications, number 1103 of LNCS, 1996.","DOI":"10.1007\/3-540-61464-8_63"},{"key":"4_CR13","doi-asserted-by":"crossref","unstructured":"G. Makanin. The problem of solvability of equations in a free semigroup. Soviet Akad. Nauk SSSR, 223(2), 1977.","DOI":"10.1070\/SM1977v032n02ABEH002376"},{"key":"4_CR14","doi-asserted-by":"crossref","unstructured":"J. Marcinkowski. Undecidability of the first order theory of one-step right ground rewriting. Int. Conference on Rewriting Techniques and Applications, LNCS. 1997.","DOI":"10.1007\/3-540-62950-5_75"},{"key":"4_CR15","unstructured":"A. Markov. The theory of algorithms. Trudy Mat. Inst. Steklov, 1(42), 1954. English Translation in Israel Program for Scientific Translations, Jerusalem, 1968."},{"key":"4_CR16","doi-asserted-by":"crossref","unstructured":"J. Niehren, M. Pinkal, and P. Ruhrberg. A uniform approach to underspecification and parallelism, 1997. Submitted. Available from http:\/\/www.ps.unisb.de\/~niehren.","DOI":"10.3115\/979617.979670"},{"key":"4_CR17","unstructured":"J. Niehren, M. Pinkal, and P. Ruhrberg. On equality up-to constraints over finite trees, context unification, and one-step rewriting. Full version. Available from http:\/\/www.ps.uni-sb.de\/~niehren."},{"key":"4_CR18","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1016\/0012-365X(84)90187-0","volume":"48","author":"J. P\u00e9cuchet","year":"1984","unstructured":"J. P\u00e9cuchet. Solution principale et rang d'un system d'\u00e8quations avec constantes dans le mono\u00efde libre. Discrete Mathematics, 48:253\u2013274, 1984.","journal-title":"Discrete Mathematics"},{"issue":"2","key":"4_CR19","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/321752.321764","volume":"20","author":"T. Pietrzykowski","year":"1973","unstructured":"T. Pietrzykowski. A complete mechanization of second-order logic. J. of the ACM, 20(2):333\u2013364, 1973.","journal-title":"J. of the ACM"},{"key":"4_CR20","unstructured":"M. Pinkal. Radical underspecification. CLAUS Report 72, Universit\u00e4t des Saarlandes, 1996."},{"key":"4_CR21","unstructured":"G. D. Plotkin. Building in equational theories. Machine Intelligence, (7):73\u201390, 1972."},{"key":"4_CR22","volume-title":"Internal report 12\/94","author":"M. Schmidt-Schau\u00df","year":"1994","unstructured":"M. Schmidt-Schau\u00df. Unification of stratified second-order terms. Internal report 12\/94, J. W. Goethe Universit\u00e4t, Frankfurt, Germany, 1994."},{"key":"4_CR23","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF00881904","volume":"11","author":"K. U. Schulz","year":"1993","unstructured":"K. U. Schulz. Word unification and transformation of generalized equations. J. of Automated Reasoning, 11:149\u2013184, 1993.","journal-title":"J. of Automated Reasoning"},{"key":"4_CR24","unstructured":"J. H. Siekmann. String-unification: Part 1. Internal Report CSM7, Essex University, 1975."},{"key":"4_CR25","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/0747-7171(92)90016-W","volume":"14","author":"R. Treinen","year":"1992","unstructured":"R. Treinen. A new method for undecidability proofs of first order theories. Journal of Symbolic Computation, 14:437\u2013457, 1992.","journal-title":"Journal of Symbolic Computation"},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"R. Treinen. The first-order theory of one-step rewriting is undecidable. Int. Conf. on Rewriting Techniques and Appl., number 1103 of LNCS, pages 276\u2013286, 1996.","DOI":"10.1007\/3-540-61464-8_59"},{"key":"4_CR27","unstructured":"S. Tulipani. Decidability of the existential theory of infinite terms with subterm relation. Journal on Information and Computation, 103(2), 1993."},{"issue":"2","key":"4_CR28","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1145\/23005.24037","volume":"34","author":"K. N. Venkataraman","year":"1987","unstructured":"K. N. Venkataraman. Decidability of the purely existential fragment of the theory of term algebra. Journal of the ACM, 34(2):492\u2013510, Apr. 1987.","journal-title":"Journal of the ACM"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"S. Vorobyov. The first-order theory of one step rewriting in linear noetherian systems is undecidable. Int. Conf. on Rewriting Techn. and Appl., LNCS. 1997.","DOI":"10.1007\/3-540-62950-5_76"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction\u2014CADE-14"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-63104-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,20]],"date-time":"2024-04-20T18:03:12Z","timestamp":1713636192000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63104-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540631040","9783540691402"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/3-540-63104-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]},"assertion":[{"value":"8 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}