{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:28:12Z","timestamp":1725488892956},"publisher-location":"Berlin, Heidelberg","reference-count":35,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540422518"},{"type":"electronic","value":"9783540457381"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45738-0_12","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T15:40:39Z","timestamp":1186760439000},"page":"199-218","source":"Crossref","is-referenced-by-count":4,"title":["Dominance Constraints in Context Unification"],"prefix":"10.1007","author":[{"given":"Joachim","family":"Niehren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Koller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,6,18]]},"reference":[{"key":"12_CR1","unstructured":"Bos, J. Predicate logic unplugged. In Proc. of the 10th Amsterdam Colloquium, pages 133\u2013143, 1996."},{"key":"12_CR2","unstructured":"Colmerauer, A. Equations and inequations on finite and in finite trees. In Proceedings of the 2nd International Conference on Fifth Generation Computer Systems, pages 85\u201399, 1984."},{"key":"12_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-55930-2","volume-title":"Coll. on Automata, Languages and Programming","author":"H. Comon","year":"1992","unstructured":"Comon, H. Completion of rewrite systems with membership constraints. In Coll. on Automata, Languages and Programming, volume 623 of LNCS, 1992."},{"key":"12_CR4","volume-title":"Semantic Ambiguity and Underspecification","author":"K. Deemter van","year":"1996","unstructured":"Deemter, K. van, and S. Peters. Semantic Ambiguity and Underspecification. CSLI, Stanford, 1996."},{"key":"12_CR5","unstructured":"Duchier, D. and C. Gardent. A constraint-based treatment of descriptions. In Proceedings of IWCS-3, Tilburg, 1999."},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Egg, M., J. Niehren, P. Ruhrberg, and F. Xu. Constraints over lambda-structures in semantic underspecification. In Proc. of COLING\/ACL, pages 253\u2013359, 1998.","DOI":"10.3115\/980845.980905"},{"key":"12_CR7","unstructured":"Gardent, C., and B. Webber. Describing discourse semantics. In Proc. of the TAG+ Workshop, Philadelphia, 1998."},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Heintze, N., and J. Jaffar. A decision procedure for a class of set constraints. In International Conference on Logic in Computer Science, pages 42\u201351, 1990.","DOI":"10.1109\/LICS.1990.113732"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Kasper, R. T., and W. C. Rounds. A logical semantics for feature structures. In Annual Meeting of the Association of Comp. Linguistics, pages 257\u2013265, 1986.","DOI":"10.3115\/981131.981166"},{"key":"12_CR10","series-title":"Master\u2019s thesis","volume-title":"Constraint languages for semantic underspecification","author":"A. Koller","year":"1999","unstructured":"Koller, A. Constraint languages for semantic underspecification. Master\u2019s thesis, Universit\u00e4t des Saarlandes, Saarbr\u00fccken, 1999. http:\/\/www.coli.uni-sb.de\/~koller\/papers\/da.html ."},{"key":"12_CR11","unstructured":"Koller, A., J. Niehren, and R. Treinen. Dominance constraints: Algorithms and complexity. In Proceedings of the Third Conference on Logical Aspects of Computational Linguistics, Grenoble, 1998."},{"key":"12_CR12","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1007\/3-540-61464-8_63","volume-title":"International Conference on Rewriting Techniques and Applications","author":"J. L\u00e9vy","year":"1996","unstructured":"L\u00e9vy, J. Linear second order unification. In International Conference on Rewriting Techniques and Applications, volume 1103 of LNCS, pages 332\u2013346, 1996."},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Makanin, G. S. The problem of solvability of equations in a free semigroup. Soviet Akad. Nauk SSSR, 223(2), 1977.","DOI":"10.1070\/SM1977v032n02ABEH002376"},{"key":"12_CR14","doi-asserted-by":"crossref","unstructured":"Marcus, M. P., D. Hindle, and M. M. Fleck. D-theory: Talking about talking about trees. In Proc. of the Annual Meeting of the ACL, 1983.","DOI":"10.3115\/981311.981337"},{"issue":"2","key":"12_CR15","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1145\/357162.357169","volume":"4","author":"A. Martelli","year":"1982","unstructured":"Martelli, A. and U. Montanari. An efficient unification algorithm. ACM TOPLAS, 4(2):258\u2013282, 1982.","journal-title":"ACM TOPLAS"},{"key":"12_CR16","unstructured":"Meyer-Viol, W., and R. Kempson. Sequential construction of logical forms. In Proceedings of the Third Conference on Logical Aspects of Computational Linguistics, Grenoble, France, 1998."},{"key":"12_CR17","unstructured":"M\u00fc, M., and J. Niehren. Ordering constraints over feature trees expressed in second-order monadic logic. Information and Computation, 2000. Special Issue on RTA, Tsukuba,Japan, March 1998. To appear."},{"key":"12_CR18","unstructured":"Mozart Consortium: Universit\u00e4t des Saarlandes, DFKI, SFB 378, SICS, Universit\u00e9 de Louvain. The Mozart System of Oz. Freely available at http:\/\/www.mozart-oz.org , January 1999."},{"key":"12_CR19","volume-title":"CLAUS Report","author":"R. Muskens","year":"1998","unstructured":"Muskens, R. Underspecified semantics. CLAUS Report 95, Univ. des Saarlandes, Saarbr\u00fccken, 1998."},{"key":"12_CR20","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1007\/3-540-63104-6_4","volume-title":"Proc. of the CADE","author":"J. Niehren","year":"1997","unstructured":"Niehren, J., M. Pinkal, and P. Ruhrberg. On equality up-to constraints over finite trees, context unification and one-step rewriting. In Proc. of the CADE, volume 1249 of LNCS, pages 34\u201348, 1997."},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Niehren, J., M. Pinkal, and P. Ruhrberg. A uniform approach to underspecification and parallelism. In Annual Meeting of the Association of Comp. Linguistics, pages 410\u2013417, 1997.","DOI":"10.3115\/979617.979670"},{"key":"12_CR22","unstructured":"Niehren, J., R. Treinen, and S. Tison. On rewrite constraints and context unification. Technical report, Universit\u00e4t des Saarlandes, Programming Systems Lab, 1999. Submitted. Available at http:\/\/www.ps.uni-sb.de\/Papers\/abstracts\/rewrite-context ."},{"key":"12_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/1995086","volume":"141","author":"M. O. Rabin","year":"1969","unstructured":"Rabin, M. O. Decidability of second-order theories and automata on infinite trees. Transactions of the American Mathematical Society, 141:1\u201335, 1969.","journal-title":"Transactions of the American Mathematical Society"},{"key":"12_CR24","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:123\u2013179, 1993.","journal-title":"Journal of Semantics"},{"key":"12_CR25","unstructured":"Decidability of context unification. The RTA list of open problems, number 90, http:\/\/www.lri.fr\/~rtaloop\/ , 1998."},{"key":"12_CR26","series-title":"Technical Report 12\/94","volume-title":"Unification of stratified second-order terms","author":"M. Schmidt-Schau\u03b2","year":"1994","unstructured":"Schmidt-Schau\u03b2, M. Unification of stratified second-order terms. Technical Report 12\/94, J. W. Goethe Universit\u00e4t, Frankfurt, 1994."},{"issue":"3","key":"12_CR27","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1006\/jsco.1996.0054","volume":"22","author":"M. Schmidt-Schau\u03b2","year":"1997","unstructured":"Schmidt-Schau\u03b2, M. A inification algorithm for distributivity and a multiplicative unit. J. of Symbolic Computation, 22(3):315\u2013344, 1997","journal-title":"J. of Symbolic Computation"},{"key":"12_CR28","series-title":"Lect Notes Comput Sci","volume-title":"International Conference on Rewriting Techniques and Applications","author":"M. Schmidt-Schau\u03b2","year":"1998","unstructured":"Schmidt-Schau\u03b2, M., and K. Schulz. On the exponent of periodicity of minimal solutions of context equations. In International Conference on Rewriting Techniques and Applications, volume 1379 of LNCS, 1998."},{"key":"12_CR29","series-title":"Lect Notes Comput Sci","volume-title":"Proc. of the CADE","author":"M. Schmidt-Schau\u03b2","year":"1999","unstructured":"Schmidt-Schau\u03b2, M., and K. Schulz. Solvability of context equations with two context variables is decidable. In Proc. of the CADE, LNCS, 1999."},{"key":"12_CR30","first-page":"149","volume":"11","author":"K. U. Schulz","year":"1993","unstructured":"Schulz, K. U. Word unification and transformation of generalized equations. Information and Computation, 11:149\u2013184, 1993.","journal-title":"Information and Computation"},{"key":"12_CR31","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1016\/0743-1066(92)90039-6","volume":"12","author":"G. Smolka","year":"1992","unstructured":"Smolka, G. Feature constraint logics for unification grammars. Journal of Logic Programming, 12:51\u201387, 1992.","journal-title":"Journal of Logic Programming"},{"key":"12_CR32","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"324","DOI":"10.1007\/BFb0015252","volume-title":"Computer Science Today","author":"G. Smolka","year":"1995","unstructured":"Smolka, G. The Oz programming model. In Jan van Leeuwen, editor, Computer Science Today, Lecture Notes in Computer Science, vol. 1000, pages 324\u2013343. Springer-Verlag, 1995."},{"key":"12_CR33","unstructured":"Talbot, J.-M., Ph. Devienne, and S. Tison. Generalized definite set constraints. Constraints, an International Journal, Special Issue on CP\u201997, January 2000."},{"issue":"2","key":"12_CR34","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1145\/23005.24037","volume":"34","author":"K. N. Venkataraman","year":"1987","unstructured":"Venkataraman, K. N. Decidability of the purely existential fragment of the theory of term algebra. Journal of the ACM, 34(2):492\u2013510, 1987.","journal-title":"Journal of the ACM"},{"issue":"4","key":"12_CR35","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, 18(4):481\u2013517, 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\/3-540-45738-0_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T22:21:31Z","timestamp":1556749291000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45738-0_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540422518","9783540457381"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/3-540-45738-0_12","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}