{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T02:44:37Z","timestamp":1764557077439},"reference-count":22,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1998,12,1]],"date-time":"1998-12-01T00:00:00Z","timestamp":912470400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":5350,"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":[[1998,12]]},"DOI":"10.1016\/s0004-3702(98)00093-9","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:24:09Z","timestamp":1027657449000},"page":"205-219","source":"Crossref","is-referenced-by-count":25,"title":["A complete classification of tractability in Allen's algebra relative to subsets of basic relations"],"prefix":"10.1016","volume":"106","author":[{"given":"Thomas","family":"Drakengren","sequence":"first","affiliation":[]},{"given":"Peter","family":"Jonsson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"11","key":"10.1016\/S0004-3702(98)00093-9_BIB1","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1145\/182.358434","article-title":"Maintaining knowledge about temporal intervals","volume":"26","author":"Allen","year":"1983","journal-title":"Comm. ACM"},{"key":"10.1016\/S0004-3702(98)00093-9_BIB2","series-title":"Reasoning about Plans","first-page":"1","article-title":"Temporal reasoning and planning","author":"Allen","year":"1991"},{"key":"10.1016\/S0004-3702(98)00093-9_BIB3","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1090\/S0002-9904-1976-14122-5","article-title":"Every planar map is four colorable","volume":"82","author":"Appel","year":"1976","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/S0004-3702(98)00093-9_BIB4","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1016\/0004-3702(91)90006-6","article-title":"Temporal constraint networks","volume":"49","author":"Dechter","year":"1991","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(98)00093-9_BIB5","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1613\/jair.340","article-title":"Eight maximal tractable subclasses of Allen's algebra with metric time","volume":"7","author":"Drakengren","year":"1997","journal-title":"J. Artificial Intelligence Research"},{"key":"10.1016\/S0004-3702(98)00093-9_BIB6","series-title":"Proceedings IJCAI-97","article-title":"Towards a complete classification of tractability in Allen's algebra","author":"Drakengren","year":"1997"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(98)00093-9_BIB7","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/S0004-3702(97)00021-0","article-title":"Twenty-one large tractable subclasses of Allen's algebra","volume":"93","author":"Drakengren","year":"1997","journal-title":"Artificial Intelligence"},{"issue":"3","key":"10.1016\/S0004-3702(98)00093-9_BIB8","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1145\/152947.152953","article-title":"Temporal reasoning in Timegraph I\u2013II","volume":"4","author":"Gerevini","year":"1993","journal-title":"SIGART Bulletin"},{"issue":"5","key":"10.1016\/S0004-3702(98)00093-9_BIB9","doi-asserted-by":"crossref","first-page":"1108","DOI":"10.1145\/174147.169675","article-title":"Complexity and algorithms for reasoning about time: a graph-theoretic approach","volume":"40","author":"Golumbic","year":"1993","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(98)00093-9_BIB10","series-title":"Proceedings AAAI-96","first-page":"1235","article-title":"A linear-programming approach to temporal reasoning","author":"Jonsson","year":"1996"},{"key":"10.1016\/S0004-3702(98)00093-9_BIB11","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 Research"},{"key":"10.1016\/S0004-3702(98)00093-9_BIB12","series-title":"Proceedings Fifth International Conference on Principles of Knowledge Representation and Reasoning (KR-96)","first-page":"352","article-title":"Tractable subclasses of the point-interval algebra: a complete classification","author":"Jonsson","year":"1996"},{"key":"10.1016\/S0004-3702(98)00093-9_BIB13","series-title":"Proceedings AAAI-91","first-page":"241","article-title":"Integrating metric and temporal qualitative temporal reasoning","author":"Kautz","year":"1991"},{"key":"10.1016\/S0004-3702(98)00093-9_BIB14","series-title":"Proceedings AAAI-91","first-page":"260","article-title":"Combining qualitative and quantitative constraints in temporal reasoning","author":"Meiri","year":"1991"},{"key":"10.1016\/S0004-3702(98)00093-9_BIB15","series-title":"Proceedings ECAI-96","article-title":"Solving hard qualitative temporal reasoning problems: evaluating the efficiency of using the ORD-Horn class","author":"Nebel","year":"1996"},{"key":"10.1016\/S0004-3702(98)00093-9_BIB16_1","series-title":"Software for machine assisted analysis of Allen's interval algebra","author":"Nebel","year":"1993"},{"issue":"1","key":"10.1016\/S0004-3702(98)00093-9_BIB17","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(98)00093-9_BIB18","series-title":"Features and Fluents","author":"Sandewall","year":"1994"},{"key":"10.1016\/S0004-3702(98)00093-9_BIB19","series-title":"Proceedings AAAI-88","first-page":"745","article-title":"The interpretation of temporal relations in narrative","author":"Song","year":"1988"},{"issue":"3","key":"10.1016\/S0004-3702(98)00093-9_BIB20","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1111\/j.1467-8640.1990.tb00130.x","article-title":"Exact and approximate reasoning about temporal relations","volume":"6","author":"van Beek","year":"1990","journal-title":"Computational Intelligence"},{"key":"10.1016\/S0004-3702(98)00093-9_BIB21","series-title":"Proceedings AAAI-86","first-page":"373","article-title":"Constraint propagation algorithms for temporal reasoning","author":"Vilain","year":"1986"},{"key":"10.1016\/S0004-3702(98)00093-9_BIB22","series-title":"Proceedings AAAI-82","first-page":"197","article-title":"A system for reasoning about time","author":"Vilain","year":"1982"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370298000939?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370298000939?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T15:16:52Z","timestamp":1580915812000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370298000939"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,12]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,12]]}},"alternative-id":["S0004370298000939"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(98)00093-9","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1998,12]]}}}