{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:06:19Z","timestamp":1761620779405},"reference-count":19,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,8,22]],"date-time":"2013-08-22T00:00:00Z","timestamp":1377129600000},"content-version":"vor","delay-in-days":4008,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1016\/s0004-3702(02)00224-2","type":"journal-article","created":{"date-parts":[[2002,9,9]],"date-time":"2002-09-09T16:43:49Z","timestamp":1031589829000},"page":"153-173","source":"Crossref","is-referenced-by-count":9,"title":["Disjunctions, independence, refinements"],"prefix":"10.1016","volume":"140","author":[{"given":"Mathias","family":"Broxvall","sequence":"first","affiliation":[]},{"given":"Peter","family":"Jonsson","sequence":"additional","affiliation":[]},{"given":"Jochen","family":"Renz","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(02)00224-2_BIB001","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0020-0190(79)90002-4","article-title":"A linear time algorithm for testing the truth of certain quantified Boolean formulas","volume":"8","author":"Aspvall","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0004-3702(02)00224-2_BIB002","series-title":"Proceedings of the 4th International Conference on Principles on Knowledge Representation and Reasoning (KR-94), Bonn, Germany","first-page":"165","article-title":"Spatial reasoning with propositional logics","author":"Bennett","year":"1994"},{"key":"10.1016\/S0004-3702(02)00224-2_BIB003","series-title":"Proceedings of the 12th European Conference on Artificial Intelligence (ECAI-96), Budapest, Hungary","first-page":"3","article-title":"Global consistency in interval algebra networks: Tractable subclasses","author":"Bessi\u00e8re","year":"1996"},{"key":"10.1016\/S0004-3702(02)00224-2_BIB004","series-title":"Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming (CP-99), Alexandria, VA","first-page":"448","article-title":"Towards a complete classification of tractability in point algebras for nonlinear time","author":"Broxvall","year":"1999"},{"key":"10.1016\/S0004-3702(02)00224-2_BIB005","series-title":"Proceedings AAAI-2000, Austin, TX","first-page":"464","article-title":"Disjunctive temporal reasoning in partially ordered time structures","author":"Broxvall","year":"2000"},{"key":"10.1016\/S0004-3702(02)00224-2_BIB006","series-title":"Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming (CP-2000), Singapore","first-page":"114","article-title":"Refinements and independence: A simple method for identifying tractable disjunctive constraints","author":"Broxvall","year":"2000"},{"key":"10.1016\/S0004-3702(02)00224-2_BIB007","series-title":"Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming (CP-2000), Singapore","first-page":"160","article-title":"New tractable classes from old","author":"Cohen","year":"2000"},{"issue":"5","key":"10.1016\/S0004-3702(02)00224-2_BIB008","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1145\/355483.355485","article-title":"Building tractable disjunctive constraints","volume":"47","author":"Cohen","year":"2001","journal-title":"J. ACM"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(02)00224-2_BIB009","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/S0004-3702(99)00012-0","article-title":"Constraint satisfaction over connected row convex constraints","volume":"109","author":"Deville","year":"1999","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00224-2_BIB010","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1145\/4221.4225","article-title":"A sufficient condition for backtrack-bounded search","volume":"32","author":"Freuder","year":"1985","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(02)00224-2_BIB011","series-title":"Proceedings IJCAI-99, Stockholm, Sweden","first-page":"394","article-title":"A comparison of structural CSP decomposition methods","author":"Gottlob","year":"1999"},{"key":"10.1016\/S0004-3702(02)00224-2_BIB012","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1016\/0004-3702(95)00107-7","article-title":"Tractable constraints on ordered domains","volume":"79","author":"Jeavons","year":"1996","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00224-2_BIB013","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1613\/jair.379","article-title":"A complete classification of tractability in RCC-5","volume":"6","author":"Jonsson","year":"1997","journal-title":"J. Artificial Intelligence Res."},{"key":"10.1016\/S0004-3702(02)00224-2_BIB014","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","article-title":"Consistency in networks of relations","volume":"8","author":"Mackworth","year":"1977","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.1016\/S0004-3702(02)00224-2_BIB015","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/200836.200848","article-title":"Reasoning about temporal relations: A maximal tractable subclass of Allen's interval algebra","volume":"42","author":"Nebel","year":"1995","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(02)00224-2_BIB016","series-title":"Proceedings IJCAI-99, Stockholm, Sweden","first-page":"448","article-title":"Maximal tractable fragments of the region connection calculus: A complete analysis","author":"Renz","year":"1999"},{"key":"10.1016\/S0004-3702(02)00224-2_BIB017","unstructured":"J. Renz, On the complexity of binary relations, Technical Report, Institut f\u00fcr Informationssysteme, Technische Universit\u00e4t Wien, forthcoming"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(02)00224-2_BIB018","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1016\/S0004-3702(99)00002-8","article-title":"On the complexity of qualitative spatial reasoning: A maximal tractable fragment of the region connection calculus","volume":"108","author":"Renz","year":"1999","journal-title":"Artificial Intelligence"},{"issue":"3","key":"10.1016\/S0004-3702(02)00224-2_BIB019","doi-asserted-by":"crossref","first-page":"543","DOI":"10.1145\/210346.210347","article-title":"On the minimality and decomposability of row-convex constraint networks","volume":"42","author":"van Beek","year":"1995","journal-title":"J. ACM"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370202002242?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370202002242?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T03:52:28Z","timestamp":1580874748000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370202002242"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["S0004370202002242"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(02)00224-2","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}