{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T07:10:10Z","timestamp":1740294610894,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540280057"},{"type":"electronic","value":"9783540318644"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11532231_11","type":"book-chapter","created":{"date-parts":[[2010,7,21]],"date-time":"2010-07-21T18:56:52Z","timestamp":1279738612000},"page":"149-163","source":"Crossref","is-referenced-by-count":6,"title":["Well-Nested Context Unification"],"prefix":"10.1007","author":[{"given":"Jordi","family":"Levy","sequence":"first","affiliation":[]},{"given":"Joachim","family":"Niehren","sequence":"additional","affiliation":[]},{"given":"Mateu","family":"Villaret","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D. Angluin","year":"1980","unstructured":"Angluin, D.: Finding patterns common to a set of strings. Journal of Computer and Systems Sciences\u00a021, 46\u201362 (1980)","journal-title":"Journal of Computer and Systems Sciences"},{"key":"11_CR2","unstructured":"Bodirsky, M., Duchier, D., Miele, S., Niehren, J.: A new algorithm for normal dominance constraints. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 54\u201378 (2004)"},{"key":"11_CR3","doi-asserted-by":"crossref","first-page":"392","DOI":"10.1007\/3-540-55719-9_91","volume-title":"Automata, Languages and Programming","author":"Hubert Comon","year":"1992","unstructured":"Comon, H.: Completion of rewrite systems with membership constraints. In: ICALP 1992. LNCS, vol.\u00a0623 (1992)"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/BF00630923","volume":"14","author":"M. Dalrymple","year":"1991","unstructured":"Dalrymple, M., Shieber, S., Pereira, F.: Ellipsis and higher-order unification. Linguistics & Philosophy\u00a014, 399\u2013452 (1991)","journal-title":"Linguistics & Philosophy"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1023\/A:1017964622902","volume":"10","author":"M. Egg","year":"2001","unstructured":"Egg, M., Koller, A., Niehren, J.: The constraint language for lambda structures. Journal of Logic, Language, and Information\u00a010, 457\u2013485 (2001)","journal-title":"Journal of Logic, Language, and Information"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Erk, K.E., Niehren, J.: Well-nested parallelism constraints for ellipsis resolution. In: 11th Conf. of the European Chapter of the Ass. of Comp. Ling., pp. 115\u2013122 (2003)","DOI":"10.3115\/1067807.1067824"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Gardent, C., Kohlhase, M.: Higher\u2013order coloured unification and natural language semantics. In: 34th Meet. of the Ass. for Comput. Ling. (1996)","DOI":"10.3115\/981863.981864"},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/3-540-61464-8_63","volume-title":"Rewriting Techniques and Applications","author":"J. Levy","year":"1996","unstructured":"Levy, J.: Linear second-order unification. In: Ganzinger, H. (ed.) RTA 1996. LNCS, vol.\u00a01103, pp. 332\u2013346. Springer, Heidelberg (1996)"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/10721975_11","volume-title":"Rewriting Techniques and Applications","author":"J. Levy","year":"2000","unstructured":"Levy, J., Villaret, M.: Linear second-order unification and context unification with tree-regular constraints. In: Bachmair, L. (ed.) RTA 2000. LNCS, vol.\u00a01833, pp. 156\u2013171. Springer, Heidelberg (2000)"},{"issue":"2","key":"11_CR10","doi-asserted-by":"publisher","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\u00a032(2), 129\u2013198 (1977)","journal-title":"Math. USSR Sbornik"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Montague, R.: The proper treatment of quantification in ordinary English. In: Approaches to Natural Language, Dordrecht (1973)","DOI":"10.1007\/978-94-010-2506-5_10"},{"key":"11_CR12","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/3-540-45738-0_12","volume-title":"Logical Aspects of Computational Linguistics","author":"J. Niehren","year":"2001","unstructured":"Niehren, J., Koller, A.: Dominance constraints in context unification. In: Moortgat, M. (ed.) LACL 1998. LNCS (LNAI), vol.\u00a02014, pp. 199\u2013218. Springer, Heidelberg (2001)"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Niehren, J., Pinkal, M., Ruhrberg, P.: A uniform approach to underspecification and parallelism. In: 35th Meeting of the Association of Computational Linguistics, pp. 410\u2013417 (1997)","DOI":"10.3115\/976909.979670"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/BFb0049431","volume-title":"Algorithms - ESA \u201994","author":"W. Plandowski","year":"1994","unstructured":"Plandowski, W.: Testing equivalence of morphisms in context-free languages. In: van Leeuwen, J. (ed.) ESA 1994. LNCS, vol.\u00a0855, pp. 460\u2013470. Springer, Heidelberg (1994)"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"Plandowski, W.: The Complexity of the Morphism Equivalence Problem for Context-Free Languages. PhD thesis, Department of Mathematics, Informatics and Mechanics, Warsaw University (1995)","DOI":"10.1007\/BFb0049431"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Plandowski, W.: Satisfiability of word equations with constants is in PSPACE. In: 40th IEEE Found. of Comp. Science, pp. 495\u2013500 (1999)","DOI":"10.1145\/301250.301443"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/BFb0055097","volume-title":"Automata, Languages and Programming","author":"W. Plandowski","year":"1998","unstructured":"Plandowski, W., Rytter, W.: Application of lempel-ziv encodings to the solution of word equations. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 731\u2013742. Springer, Heidelberg (1998)"},{"key":"11_CR18","unstructured":"Sag, I.: Deletion and logical form. PhD thesis, MIT, Cambridge (1976)"},{"key":"11_CR19","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1093\/logcom\/12.6.929","volume":"12","author":"M. Schmidt-Schau\u00df","year":"2002","unstructured":"Schmidt-Schau\u00df, M.: A decision algorithm for stratified context unification. Journal of Logic and Computation\u00a012, 929\u2013953 (2002)","journal-title":"Journal of Logic and Computation"},{"key":"11_CR20","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/3-540-48660-7_5","volume-title":"Automated Deduction \u2014 CADE-16","author":"Manfred Schmidt-Schau\u00df","year":"1999","unstructured":"Schmidt-Schau\u00df, M., Schulz, K.U.: Solvability of context equations with two context variables is decidable. In: 16th Int. Conf. on Automated Deduction. LNCS (LNAI), pp. 67\u201381 (1999)"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE-20"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11532231_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,23]],"date-time":"2025-02-23T06:05:13Z","timestamp":1740290713000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11532231_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540280057","9783540318644"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11532231_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}