{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:41:17Z","timestamp":1725486077271},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540410539"},{"type":"electronic","value":"9783540453499"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-45349-0_10","type":"book-chapter","created":{"date-parts":[[2007,6,6]],"date-time":"2007-06-06T20:54:55Z","timestamp":1181163295000},"page":"114-127","source":"Crossref","is-referenced-by-count":2,"title":["Refinements and Independence: A Simple Method for Identifying Tractable Disjunctive Constraints"],"prefix":"10.1007","author":[{"given":"Mathias","family":"Broxvall","sequence":"first","affiliation":[]},{"given":"Peter","family":"Jonsson","sequence":"additional","affiliation":[]},{"given":"Jochen","family":"Renz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,6,1]]},"reference":[{"key":"10_CR1","unstructured":"F. Anger, D. Mitra, and R. Rodriguez. Temporal constraint networks in nonlinear time. Technical report, ECAI Workshop on Temporal and Spatial Reasoning, 1998."},{"key":"10_CR2","unstructured":"C. Bessi\u00e8re, A. Isli, and G. Ligozat. Global consistency in interval algebra networks: tractable subclasses. In W. Wahlster, editor, Proceedings of the 12th European Conference on Artificial Intelligence (ECAI-96), pages 3\u20137, Budapest, Hungary, Aug. 1996. Wiley."},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"M. Broxvall and P. Jonsson. Towards a complete classification of tractability in point algebras for nonlinear time. In Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming (CP-99), pages 448\u2013454, Alexandria, VA, USA, Oct. 1999.","DOI":"10.1007\/978-3-540-48085-3_10"},{"key":"10_CR4","unstructured":"M. Broxvall and P. Jonsson. Disjunctive temporal reasoning in partially ordered time structures. In Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-2000). AAAI Press, 2000. To appear."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"D. Cohen, P. Jeavons, and M. Koubarakis. Tractable disjunctive constraints. In Proceedings of the 3rd International Conference on Principles and Practice for Constraint Programming, pages 478\u2013490, 1997.","DOI":"10.1007\/BFb0017461"},{"issue":"1\u20132","key":"10_CR6","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/S0004-3702(99)00012-0","volume":"109","author":"Y. Deville","year":"1999","unstructured":"Y. Deville, O. Barette, and P. van Hentenryck. Constraint satisfaction over connected row convex constraints. Artificial Intelligence, 109(1\u20132):243\u2013271, 1999.","journal-title":"Artificial Intelligence"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1145\/4221.4225","volume":"32","author":"E. C. Freuder","year":"1985","unstructured":"E. C. Freuder. A sufficient condition for backtrack-bounded search. Journal of the ACM, 32:755\u2013761, 1985.","journal-title":"Journal of the ACM"},{"key":"10_CR8","unstructured":"G. Gottlob, N. Leone, and F. Scarcello. A comparison of structural CSP decomposition methods. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99), pages 394\u2013399, Stockholm, Sweden, 1999."},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"P. G. Jeavons, D. Cohen and M. Gyssens. A test for tractability. In Proceedings of the 2nd International Conference on Principles and Practice for Constraint Programming, pages 267\u2013281, 1996.","DOI":"10.1007\/3-540-61551-2_80"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0004-3702(95)00107-7","volume":"79","author":"P. G. Jeavons","year":"1996","unstructured":"P. G. Jeavons and M. C. Cooper. Tractable constraints on ordered domains. Artificial Intelligence, 79:327\u2013339, 1996.","journal-title":"Artificial Intelligence"},{"key":"10_CR11","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1613\/jair.379","volume":"6","author":"P. Jonsson","year":"1997","unstructured":"P. Jonsson and T. Drakengren. A complete classification of tractability in RCC-5. Journal of Artificial Intelligence Research, 6:211\u2013221, 1997.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"10_CR12","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"},{"issue":"1","key":"10_CR13","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":"10_CR14","unstructured":"David A. Randell, Zhan Cui, and Anthony G. Cohn. A spatial logic based on regions and connection. In B. Nebel, W. Swartout, and C. Rich, editors, Principles of Knowledge Representation and Reasoning: Proceedings of the 3rd International Conference, pages 165\u2013176, Cambridge, MA, October 1992. Morgan Kaufmann."},{"key":"10_CR15","unstructured":"J. Renz. Maximal tractable fragments of the Region Connection Calculus: A complete analysis. In Proceedings of the 16th International Joint Conference on Artificial Intelligence (IJCAI-99), pages 129\u2013143, Stockholm, Sweden, 1999."},{"issue":"1\u20132","key":"10_CR16","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0004-3702(99)00002-8","volume":"108","author":"J. Renz","year":"1999","unstructured":"J. Renz and B. Nebel. On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the Region Connection Calculus. Artificial Intelligence, 108(1\u20132):69\u2013123, 1999.","journal-title":"Artificial Intelligence"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1145\/210346.210347","volume":"42","author":"P. Beek van","year":"1995","unstructured":"P. van Beek and R. Dechter. On the minimality and decomposability of row-convex constraint networks. Journal of the ACM, 42:543\u2013561, 1995.","journal-title":"Journal of the ACM"},{"key":"10_CR18","first-page":"373","volume-title":"Readings in Qualitative Reasoning about Physical Systems","author":"M. B. Vilain","year":"1989","unstructured":"M. B. Vilain, H. Kautz and P. van Beek. Constraint propagation algorithms for temporal reasoning: A revised report. In Readings in Qualitative Reasoning about Physical Systems, pages 373\u2013381. Morgan Kaufmann, San Mateo, CA, 1989."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2013 CP 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45349-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T01:31:33Z","timestamp":1550367093000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45349-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540410539","9783540453499"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45349-0_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}