{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:27Z","timestamp":1725558987080},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540257837"},{"type":"electronic","value":"9783540319535"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11422532_15","type":"book-chapter","created":{"date-parts":[[2010,7,12]],"date-time":"2010-07-12T22:15:43Z","timestamp":1278972943000},"page":"221-237","source":"Crossref","is-referenced-by-count":0,"title":["Describing Lambda Terms in Context Unification"],"prefix":"10.1007","author":[{"given":"Joachim","family":"Niehren","sequence":"first","affiliation":[]},{"given":"Mateu","family":"Villaret","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF01048403","volume":"4","author":"R. Backofen","year":"1995","unstructured":"Backofen, R., Rogers, J., Vijay-Shanker, K.: A first-order axiomatization of the theory of finite trees. Journal of Logic, Language, and Information\u00a04, 5\u201339 (1995)","journal-title":"Journal of Logic, Language, and Information"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Bodirsky, M., Erk, K., Koller, A., Niehren, J.: Underspecified beta reduction. In: ACL, pp. 74\u201381 (2001)","DOI":"10.3115\/1073012.1073023"},{"key":"15_CR3","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1006\/jsco.1997.0185","volume":"25","author":"H. Comon","year":"1998","unstructured":"Comon, H.: Completion of rewrite systems with membership constraints. Symbolic Computation\u00a025, 397\u2013453 (1998); Extends on a paper at ICALP 1992","journal-title":"Symbolic Computation"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Duchier, D., Gardent, C.: Tree descriptions, constraints and incrementality. In: Computing Meaning. Linguistics and Philosophy, pp. 205\u2013227 (2001)","DOI":"10.1007\/978-94-010-0572-2_12"},{"key":"15_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. Logic, Language, and Information\u00a010, 457\u2013485 (2001)","journal-title":"Logic, Language, and Information"},{"issue":"1","key":"15_CR6","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1023\/A:1024516312962","volume":"1","author":"K. Erk","year":"2002","unstructured":"Erk, K., Koller, A., Niehren, J.: Processing underspecified semantic representations in the constraint language for lambda structures. Journal of Research on Language and Computation\u00a01(1), 127\u2013169 (2002)","journal-title":"Journal of Research on Language and Computation"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Erk, K., Niehren, J.: Parallelism constraints. In: Bachmair, L. (ed.) RTA 2000. LNCS, vol.\u00a01833, pp. 110\u2013126 (2000)","DOI":"10.1007\/10721975_8"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Erk, K., Niehren, J.: Well-nested parallelism constraints for ellipsis resolution. In: EACL, pp. 115\u2013122 (2003)","DOI":"10.3115\/1067807.1067824"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Levy, J.: Linear second-order unification. In: RTA 1996. LNCS, vol.\u00a01103, pp. 332\u2013346 (1996)","DOI":"10.1007\/3-540-61464-8_63"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1006\/inco.2000.2877","volume":"159","author":"J. Levy","year":"2000","unstructured":"Levy, J., Veanes, M.: On the undecidability of second-order unification. Information and Computation\u00a0159, 125\u2013150 (2000)","journal-title":"Information and Computation"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Levy, J., Villaret, M.: Linear second-order unification and context unification with tree-regular constraints. In: RTA, pp. 156\u2013171 (2000)","DOI":"10.1007\/10721975_11"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/3-540-45127-7_14","volume-title":"Rewriting Techniques and Applications","author":"J. Levy","year":"2001","unstructured":"Levy, J., Villaret, M.: Context unification and traversal equations. In: Middeldorp, A. (ed.) RTA 2001. LNCS, vol.\u00a02051, pp. 169\u2013184. Springer, Heidelberg (2001)"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Marcus, M.P., Hindle, D., Fleck, M.M.: D-theory: Talking about talking about trees. In: Proceedings of the 21st ACL, pp. 129\u2013136 (1983)","DOI":"10.3115\/981311.981337"},{"key":"15_CR14","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, p. 199. Springer, Heidelberg (2001)"},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"Niehren, J., Thater, S.: Bridging the gap between underspecification formalisms: Minimal recursion semantics as dominance constraints. In: 41st Meeting of the Association of Computational Linguistics, July 2003, pp. 367\u2013374 (2003)","DOI":"10.3115\/1075096.1075143"},{"key":"15_CR16","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/3-540-36078-6_21","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"J. Niehren","year":"2002","unstructured":"Niehren, J., Villaret, M.: Parallelism and tree regular constraints. In: Baaz, M., Voronkov, A. (eds.) LPAR 2002. LNCS (LNAI), vol.\u00a02514, pp. 311\u2013326. Springer, Heidelberg (2002)"},{"key":"15_CR17","unstructured":"Pinkal, M.: Radical underspecification. In: Proceedings of the 10th Amsterdam Colloquium, pp. 587\u2013606 (1996)"},{"key":"15_CR18","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/S0304-3975(98)00081-4","volume":"208","author":"M. Schmidt-Schau\u00df","year":"1998","unstructured":"Schmidt-Schau\u00df, M.: A decision algorithm for distributive unification. Theoretical Computer Science\u00a0208, 111\u2013148 (1998)","journal-title":"Theoretical Computer Science"},{"key":"15_CR19","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/3-540-48660-7_5","volume-title":"Automated Deduction - CADE-16","author":"M. Schmidt-Schau\u00df","year":"1999","unstructured":"Schmidt-Schau\u00df, M., Schulz, K.U.: Solvability of context equations with two context variables is decidable. In: Ganzinger, H. (ed.) CADE 1999. LNCS (LNAI), vol.\u00a01632, pp. 67\u201381. Springer, Heidelberg (1999)"},{"key":"15_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"522","DOI":"10.1007\/3-540-45793-3_35","volume-title":"Computer Science Logic","author":"M. Schmidt-Schau\u00df","year":"2002","unstructured":"Schmidt-Schau\u00df, M., Schulz, K.U.: Decidability of bounded higher-order unification. In: Bradfield, J.C. (ed.) CSL 2002 and EACSL 2002. LNCS, vol.\u00a02471, p. 522. Springer, Heidelberg (2002)"},{"key":"15_CR21","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/BF00632780","volume":"19","author":"S. Shieber","year":"1996","unstructured":"Shieber, S., Pereira, F., Dalrymple, M.: Interaction of scope and ellipsis. Linguistics & Philosophy\u00a019, 527\u2013552 (1996)","journal-title":"Linguistics & Philosophy"},{"issue":"1","key":"15_CR22","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/BF01691346","volume":"2","author":"J.W. Thatcher","year":"1967","unstructured":"Thatcher, J.W., Wright, J.B.: Generalized finite automata theory with an application to a decision problem of second-order logic. Mathematical Systems Theory\u00a02(1), 57\u201381 (1967)","journal-title":"Mathematical Systems Theory"},{"key":"15_CR23","first-page":"481","volume":"18","author":"K. Vijay-Shanker","year":"1992","unstructured":"Vijay-Shanker, K.: Using descriptions of trees in a tree adjoining grammar. Computational Linguistics\u00a018, 481\u2013518 (1992)","journal-title":"Computational Linguistics"}],"container-title":["Lecture Notes in Computer Science","Logical Aspects of Computational Linguistics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11422532_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:04:08Z","timestamp":1619492648000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11422532_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540257837","9783540319535"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/11422532_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}