{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:51:48Z","timestamp":1742914308176,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":46,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540894070"},{"type":"electronic","value":"9783540894087"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-540-89408-7_15","type":"book-chapter","created":{"date-parts":[[2010,2,11]],"date-time":"2010-02-11T15:03:45Z","timestamp":1265900625000},"page":"337-364","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Scope Underspecification with Tree Descriptions: Theory and Practice"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Koller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Thater","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manfred","family":"Pinkal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,2,5]]},"reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/S0196-6774(03)00050-6","volume":"48","author":"E. Althaus","year":"2003","unstructured":"Althaus, E., Duchier, D., Koller, A., Mehlhorn, K., Niehren, J., Thiel, S.: An efficient graph algorithm for dominance constraints. Journal of Algorithms 48, 194\u2013219 (2003)","journal-title":"Journal of Algorithms"},{"key":"15_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511615320","volume-title":"Principles of Constraint Programming","author":"K.R. Apt","year":"2003","unstructured":"Apt, K.R.: Principles of Constraint Programming. Cambridge University Press, Cambridge (2003)"},{"key":"15_CR3","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 4, 5\u201339 1995","journal-title":"Journal of Logic, Language, and Information"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Bender, E., Flickinger, D.P., Oepen, S.: The grammar matrix: An open-source starter-kit for the rapid development of cross-linguistically consistent broad-coverage precision grammars. In: Proceedings of the ACL Workshop on Effective Tools and Methodologies for Teaching Natural Language Processing and Computational Linguistics. Philadelphia (2002)","DOI":"10.3115\/1118783.1118785"},{"key":"15_CR5","unstructured":"Bodirsky, M., Duchier, D., Niehren, J., Miele, S.: An efficient algorithm for weakly normal dominance constraints. In: ACM-SIAM Symposium on Discrete Algorithms. The ACM Press, New York (2004)"},{"key":"15_CR6","unstructured":"Bos, J.: Predicate logic unplugged. In: Amsterdam Colloquium. Amsterdam pp. 133\u2013143 (1996)"},{"key":"15_CR7","unstructured":"Comon, H., Dauchet, M., Gilleron, R., L\u00f6ding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications. Available at http:\/\/www.grappa.univ-lille3.fr\/tata (2007)"},{"key":"15_CR8","unstructured":"Copestake, A., Flickinger, D.: An open-source grammar development environment and broad-coverage english grammar using HPSG. In: Conference on Language Resources and Evaluation. The LKB system is available at http:\/\/www.delph-in.net\/lkb\/ (2000)"},{"issue":"2\u20133","key":"15_CR9","first-page":"281","volume":"3","author":"A. Copestake","year":"2004","unstructured":"Copestake, A., Flickinger, D., Pollard, C., Sag, I.: Minimal recursion semantics: An introduction. Journal of Research on Language and Computation \\bf 3(2\u20133), 281\u2013332 (2004)","journal-title":"Journal of Research on Language and Computation \\bf"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Copestake, A., Lascarides, A., Flickinger, D.: An algebra for semantic construction in constraint-based grammars. In: Proceedings of the 39th Annual Meeting of the Association for Computational Linguistics, pp. 132\u2013139. Toulouse, France (2001)","DOI":"10.3115\/1073012.1073031"},{"volume-title":"Semantics and syntax in Lexical Functional Grammar","year":"1999","key":"15_CR11","unstructured":"Dalrymple, M. (ed.): Semantics and syntax in Lexical Functional Grammar. MIT Press, Cambridge, MA (1999)"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Debusmann, R., Duchier, D., Koller, A., Kuhlmann, M., Smolka, G., Thater, S.: A relational syntax-semantics interface based on dependency grammar. In: Proceedings of the 20th COLING. Geneva (2004)","DOI":"10.3115\/1220355.1220381"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Duchier, D., Niehren, J.: Dominance constraints with set operators. In: Proceedings of the First International Conference on Computational Logic, no. 1861 in Lecture Notes in Computer Science, pp. 326\u2013341. Springer-Verlag, Berlin (2000)","DOI":"10.1007\/3-540-44957-4_22"},{"key":"15_CR14","volume-title":"Flexible semantics for reinterpretation phenomena","author":"M. Egg","year":"2005","unstructured":"Egg, M.: Flexible semantics for reinterpretation phenomena. CSLI Press, Stanford, CA (2005)"},{"key":"15_CR15","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 10, 457\u2013485 2001","journal-title":"Logic, Language, and Information"},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1023\/A:1024516312962","volume":"1","author":"K. Erk","year":"2003","unstructured":"Erk, K., Koller, A., Niehren, J.: Processing underspecified semantic descriptions in the constraint language for lambda structures. Research on Language and Computation 1, 127\u2013169 2003","journal-title":"Research on Language and Computation"},{"key":"15_CR17","first-page":"129","volume-title":"The Proceedings of the 12th International Conference on Head-Driven Phrase Structure Grammar","author":"D. Flickinger","year":"2005","unstructured":"Flickinger, D., Koller, A., Thater, S.: A new well-formedness criterion for semantics debugging. In: S. M\u00fcller (ed.) The Proceedings of the 12th International Conference on Head-Driven Phrase Structure Grammar, pp. 129\u2013142. CSLI Publications, Stanford, CA (2005)"},{"key":"15_CR18","unstructured":"Frey, W.: Syntaktische bedingungen f\u00fcr die semantisch interpretation. \u00fcber bindung, implizite argumente und skopus. studia grammatika (1993)"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Fuchss, R., Koller, A., Niehren, J., Thater, S.: Minimal recursion semantics as dominance constraints: Translation, evaluation, and analysis. In: Proceedings of the 42nd ACL. Barcelona (2004)","DOI":"10.3115\/1218955.1218987"},{"key":"15_CR20","unstructured":"Gardent, C., Webber, B.: Describing discourse semantics. In: Proceedings of the 4th TAG+ Workshop. Philadelphia (1998)"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"Gottlob, G., Koch, C., Schulz, K.U.: Conjunctive queries over trees. In: 23rd ACM Symposium on Principles of Database Systems, pp. 189\u2013200. ACM Press, New York (2004)","DOI":"10.1145\/1055558.1055585"},{"issue":"1","key":"15_CR22","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1162\/089120103321337449","volume":"29","author":"D. Higgins","year":"2003","unstructured":"Higgins, D., Sadock, J.: A machine learning approach to modeling scope preferences. Computational Linguistics 29(1), 73\u201396 (2003)","journal-title":"Computational Linguistics"},{"key":"15_CR23","unstructured":"Jaspars, J., Koller, A.: A calculus for direct deduction with dominance constraints. In: Proceedings of the 12th Amsterdam Colloquium. Amsterdam (1999)"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Koller, A., Niehren, J., Thater, S.: Bridging the gap between underspecification formalisms: Hole semantics as dominance constraints. In: EACL\u201903. Budapest (2003)","DOI":"10.3115\/1067807.1067834"},{"key":"15_CR25","doi-asserted-by":"crossref","unstructured":"Koller, A., Niehren, J., Treinen, R.: Dominance constraints: Algorithms and complexity. In: Proceedings of LACL, pp. 106\u2013125. Appeared in 2001 as volume 2014 of LNAI, Springer Verlag (1998)","DOI":"10.1007\/3-540-45738-0_7"},{"key":"15_CR26","unstructured":"Koller, A., Regneri, M., Thater, S.: Regular tree grammars as a formalism for scope underspecification. In: Proceedings of ACL-08 (2008)"},{"key":"15_CR27","doi-asserted-by":"crossref","unstructured":"Koller, A., Thater, S.: The evolution of dominance constraint solvers. In: Proceedings of the ACL-05 Workshop on Software. Ann Arbor (2005)","DOI":"10.3115\/1626315.1626320"},{"key":"15_CR28","doi-asserted-by":"crossref","unstructured":"Koller, A., Thater, S.: An improved redundancy elimination algorithm for underspecified descriptions. In: Proceedings of COLING\/ACL-2006. Sydney (2006)","DOI":"10.3115\/1220175.1220227"},{"key":"15_CR29","unstructured":"Koller, A., Thater, S.: Solving unrestricted dominance graphs. In: Proceedings of the 12th Conference on Formal Grammar. Dublin (2007)"},{"key":"15_CR30","doi-asserted-by":"crossref","unstructured":"Marcus, M.P., Hindle, D., Fleck, M.M.: D-theory: Talking about talking about trees. In: 21st Annual Meeting of the ACL, pp. 129\u2013136, Cambridge (1983).","DOI":"10.3115\/981311.981337"},{"key":"15_CR31","unstructured":"M\u00fcller, S.: The Grammix CD Rom. a software collection for developing typed feature structure grammars. In: T.H. King, E.M. Bender (eds.) Grammar Engineering across Frameworks 2007, Studies in Computational Linguistics ONLINE, pp. 259\u2013266. CSLI Publications, Stanford (2007). URL http:\/\/hpsg.fu-berlin.de\/stefan\/Pub\/grammix.html"},{"key":"15_CR32","first-page":"104","volume-title":"13. Workshop Logische Programmierung","author":"T. M\u00fcller","year":"1997","unstructured":"M\u00fcller, T., M\u00fcller, M.: Finite set constraints in Oz. In: F. cois Bry, B. Freitag, D. Seipel (eds.) 13. Workshop Logische Programmierung, pp. 104\u2013115. Technische Universit\u00e4t M\u00fcnchen (1997)"},{"key":"15_CR33","unstructured":"Niehren, J., Koller, A.: Dominance constraints in context unification. In: Proceedings of the Third Conference on Logical Aspects of Computational Linguistics (LACL \u201998). Grenoble, France (1998)"},{"key":"15_CR34","doi-asserted-by":"crossref","unstructured":"Niehren, J., Pinkal, M., Ruhrberg, P.: A uniform approach to underspecification and parallelism. In: Proceedings ACL\u201997, pp. 410\u2013417. Madrid (1997)","DOI":"10.3115\/979617.979670"},{"key":"15_CR35","doi-asserted-by":"crossref","unstructured":"Niehren, J., Thater, S.: Bridging the gap between underspecification formalisms: Minimal recursion semantics as dominance constraints. In: Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics (2003)","DOI":"10.3115\/1075096.1075143"},{"key":"15_CR36","doi-asserted-by":"crossref","unstructured":"Oepen, S., Toutanova, K., Shieber, S., Manning, C., Flickinger, D., Brants, T.: The LinGO Redwoods treebank: Motivation and preliminary applications. In: Proceedings of the 19th International Conference on Computational Linguistics (COLING\u201902), pp. 1253\u20131257 (2002)","DOI":"10.3115\/1071884.1071909"},{"key":"15_CR37","unstructured":"Oz Development Team: The Mozart Programming System. Web pages (2004). http:\/\/www.mozart-oz.org"},{"key":"15_CR38","unstructured":"Pafel, J.: Skopus und logische Struktur: Studien zum Quantorenskopus im Deutschen. Habilitationsschrift, Eberhard-Karls-Universit\u00e4t T\u00fcbingen (1997)"},{"key":"15_CR39","unstructured":"Poesio, M.: Ambiguity, Underspecification and Discourse Interpretation. In: Proceedings of the First International Workshop on Computational Semantics (1994)"},{"issue":"1","key":"15_CR40","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1093\/jos\/10.2.123","volume":"10","author":"U. Reyle","year":"1993","unstructured":"Reyle, U.: Dealing with ambiguities by underspecification: Construction, representation and deduction. Journal of Semantics 10(1), 123\u2013179 (1993)","journal-title":"Journal of Semantics"},{"key":"15_CR41","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1111\/j.1467-8640.1994.tb00005.x","volume":"10","author":"J. Rogers","year":"1994","unstructured":"Rogers, J., Vijay-Shanker, K.: Obtaining trees from their descriptions: An application to tree-adjoining grammars. Computational Intelligence 10, 401\u2013421 1994","journal-title":"Computational Intelligence"},{"key":"15_CR42","doi-asserted-by":"crossref","unstructured":"Skut, W., Krenn, B., Brants, T., Uszkoreit, H.: An annotation scheme for free word order languages. In: Proceedings of the Fifth Conference on Applied Natural Language Processing ANLP-97. Washington, DC (1997)","DOI":"10.3115\/974557.974571"},{"issue":"1","key":"15_CR43","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 anapplication to a decision problem of second-order logic. Mathematical Systems Theory 2(1), 57\u201381 (1967)","journal-title":"Mathematical Systems Theory"},{"key":"15_CR44","unstructured":"Thater, S.: Minimal recursion semantics as dominance constraints: Graph-theoretic foundation and application to grammar engineering. Ph.D. thesis, Department of Computational Linguistics, Saarland University (2007)"},{"key":"15_CR45","first-page":"203","volume-title":"Semantic Ambiguity and Underspecification","author":"K. van Deemter","year":"1996","unstructured":"van Deemter, K.: Towards a logic of ambiguous expressions. In: van Deemter, K., Peters, S. (eds.) Semantic Ambiguity and Underspecification pp. 203\u2013237. CSLI Press, Stanford, CA (1996)"},{"key":"15_CR46","doi-asserted-by":"crossref","unstructured":"Vestre, E.: An algorithm for generating non-redundant quantifier scopings. In: Proceedings of the Fifth EACL. Berlin (1991)","DOI":"10.3115\/977180.977224"}],"container-title":["Cognitive Technologies","Resource-Adaptive Cognitive Processes"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89408-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,18]],"date-time":"2023-02-18T03:28:04Z","timestamp":1676690884000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-89408-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783540894070","9783540894087"],"references-count":46,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89408-7_15","relation":{},"ISSN":["1611-2482"],"issn-type":[{"type":"print","value":"1611-2482"}],"subject":[],"published":{"date-parts":[[2010]]},"assertion":[{"value":"5 February 2010","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}