{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:32:02Z","timestamp":1725489122718},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540432838"},{"type":"electronic","value":"9783540458418"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45841-7_23","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T04:11:17Z","timestamp":1186891877000},"page":"287-298","source":"Crossref","is-referenced-by-count":5,"title":["Pure Dominance Constraints"],"prefix":"10.1007","author":[{"given":"Manuel","family":"Bodirsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Kutz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,2,21]]},"reference":[{"issue":"11","key":"23_CR1","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1145\/182.358434","volume":"26","author":"J. F. Allen","year":"1983","unstructured":"J. F. Allen. Maintaining knowledge about temporal intervals. Communications of the ACM, 26(11):832\u2013843, 1983.","journal-title":"Communications of the ACM"},{"key":"23_CR2","unstructured":"E. Althaus, D. Duchier, A. Koller, K. Mehlhorn, J. Niehren, and S. Thiel. An efficient algorithm for the configuration problem of dominance graphs. In Proceedings of the 12th ACM-SIAM Symposium on Discrete Algorithms, pages 815\u2013824, Washington, DC, Jan. 2001."},{"key":"23_CR3","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF01048403","volume":"4","author":"R. Backofen","year":"1995","unstructured":"R. Backofen, J. Rogers, and K. Vijay-Shanker. 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":"23_CR4","doi-asserted-by":"crossref","unstructured":"M. Bodirsky, K. Erk, A. Koller, and J. Niehren. Beta Reduction Constraints. In Proceedings of the 12th International Conference on Rewriting Techniques and Applications, Utrecht, 2001.","DOI":"10.1007\/3-540-45127-7_5"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"T. Cornell. On determining the consistency of partial descriptions of trees. In 32nd Annual Meeting of the Association for Computational Linguistics, pages 163\u2013170, 1994.","DOI":"10.3115\/981732.981755"},{"key":"23_CR6","unstructured":"T. Cornell. On determining the consistency of partial descriptions of trees. http:\/\/tcl.sfs.nphil.uni-tuebingen.de\/~cornell\/mss.html , 1996."},{"key":"23_CR7","series-title":"Lect Notes Comput Sci","volume-title":"Dominance constraints with set operators","author":"D. Duchier","year":"2000","unstructured":"D. Duchier and J. Niehren. Dominance constraints with set operators. In First International Conference on Computational Logic (CL2000), LNCS, July 2000."},{"key":"23_CR8","unstructured":"D. Duchier and S. Thater. Parsing with tree descriptions: a constraint-based approach. In Sixth International Workshop on Natural Language Understanding and Logic Programming (NLULP\u201999), pages 17\u201332, Las Cruces, New Mexico, Dec. 1999."},{"key":"23_CR9","unstructured":"M. Egg, A. Koller, and J. Niehren. The Constraint Language for Lambda Structures. Journal of Logic, Language, and Information, 2001. To appear."},{"key":"23_CR10","unstructured":"K. Erk, A. Koller, and J. Niehren. Processing underspecified semantic representations in the constraint language for lambda structures. Journal of Language and Computation, 2001. To appear."},{"key":"23_CR11","unstructured":"T. Feder and M. Vardi. The computational structure of monotone monadic SNP and constraint satisfaction: a study through datalog and group theory. SIAM J. Comput., (28):57\u2013104, 1999."},{"key":"23_CR12","unstructured":"C. Gardent and B. Webber. Describing discourse semantics. In Proceedings of the 4th TAG+ Workshop, Philadelphia, 1998. University of Pennsylvania."},{"key":"23_CR13","first-page":"335","volume":"4","author":"P. Hilfinger","year":"1991","unstructured":"P. Hilfinger, E. L. Lawler, and G. Rote. Flattening a rooted tree. Applied Geometry and Discrete Mathematics, 4:335\u2013340, 1991.","journal-title":"Applied Geometry and Discrete Mathematics"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"A. Koller, K. Mehlhorn, and J. Niehren. A polynomial-time fragment of dominance constraints. In Proceedings of the 38th Annual Meeting of the Association of Computational Linguistics, Hong Kong, Oct. 2000.","DOI":"10.3115\/1075218.1075265"},{"key":"23_CR15","unstructured":"A. Koller, J. Niehren, and R. Treinen. Dominance constraints: Algorithms and complexity. In Third International Conference on Logical Aspects of Computational Linguistics (LACL\u2019 98), Grenoble, France, Dec. 1998."},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"T. Lengauer. Combinatorial algorithms for integrated circuit layout. Wiley-Teubner, 1990.","DOI":"10.1007\/978-3-322-92106-2_3"},{"key":"23_CR17","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A. K. Mackworth","year":"1977","unstructured":"A. K. Mackworth. Consistency in networks of relations. Artificial Intelligence, 8:99\u2013118, 1977.","journal-title":"Artificial Intelligence"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"M. P. Marcus, D. Hindle, and M. M. Fleck. D-theory: Talking about talking about trees. In Proceedings of the 21st ACL, pages 129\u2013136, 1983.","DOI":"10.3115\/981311.981337"},{"issue":"3","key":"23_CR19","first-page":"175","volume":"1","author":"B. Nebel","year":"1997","unstructured":"B. Nebel. Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class. 1(3):175\u2013190, 1997.","journal-title":"Solving hard qualitative temporal reasoning problems: Evaluating the efficiency of using the ORD-Horn class"},{"issue":"1","key":"23_CR20","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/200836.200848","volume":"42","author":"B. Nebel","year":"1995","unstructured":"B. Nebel and H.-J. B\u00fcrckert. Reasoning about temporal relations: A maximal tractable subclass of Allen\u2019s interval algebra. Journal of the ACM, 42(1):43\u201366, 1995.","journal-title":"Journal of the ACM"},{"key":"23_CR21","unstructured":"M. Pinkal. Radical Underspecification. In Proc. 10th Amsterdam Colloquium, 1996."},{"key":"23_CR22","doi-asserted-by":"crossref","unstructured":"J. Rogers and V. Shanker. Reasoning with descriptions of trees. In Proceedings of the 30th Meeting of the Association for Computational Linguistics, 1992.","DOI":"10.3115\/981967.981977"},{"issue":"2","key":"23_CR23","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1006\/jagm.1999.1033","volume":"33","author":"M. Thorup","year":"1999","unstructured":"M. Thorup. Decremental dynamic connectivity. J. Algorithms, 33(2):229\u2013243, Nov. 1999.","journal-title":"J. Algorithms"},{"key":"23_CR24","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1111\/j.1467-8640.1990.tb00130.x","volume":"6","author":"P. Beek van","year":"1990","unstructured":"P. van Beek. Exact and approximate reasoning about temporal relations. Computational Intelligence, 6:132\u2013144, 1990.","journal-title":"Computational Intelligence"}],"container-title":["Lecture Notes in Computer Science","STACS 2002"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45841-7_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T20:00:29Z","timestamp":1556740829000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45841-7_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540432838","9783540458418"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-45841-7_23","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}