{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T20:21:19Z","timestamp":1772914879157,"version":"3.50.1"},"reference-count":43,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1995,4,1]],"date-time":"1995-04-01T00:00:00Z","timestamp":796694400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1995,4,1]],"date-time":"1995-04-01T00:00:00Z","timestamp":796694400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2000,4,6]],"date-time":"2000-04-06T00:00:00Z","timestamp":954979200000},"content-version":"vor","delay-in-days":1832,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1995,4]]},"DOI":"10.1016\/0004-3702(94)00016-t","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T22:00:28Z","timestamp":1027634428000},"page":"207-248","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":44,"title":["Efficient algorithms for qualitative reasoning about time"],"prefix":"10.1016","volume":"74","author":[{"given":"Alfonso","family":"Gerevini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lenhart","family":"Schubert","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0004-3702(94)00016-T_BIB1","doi-asserted-by":"crossref","DOI":"10.21236\/ADA247447","article-title":"The TRAINS project","author":"Allen","year":"1991"},{"issue":"1","key":"10.1016\/0004-3702(94)00016-T_BIB2","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":"Commun. ACM"},{"issue":"2","key":"10.1016\/0004-3702(94)00016-T_BIB3","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0004-3702(84)90008-0","article-title":"Towards a general theory of action and time","volume":"23","author":"Allen","year":"1984","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(94)00016-T_BIB4","series-title":"Reasoning about plans","article-title":"Temporal reasoning and planning","author":"Allen","year":"1991"},{"key":"10.1016\/0004-3702(94)00016-T_BIB5","series-title":"Proceedings IJCAI-83","first-page":"741","article-title":"Planning using a temporal world model","author":"Allen","year":"1983"},{"key":"10.1016\/0004-3702(94)00016-T_BIB6","article-title":"Temporal reasoning for planning and scheduling","author":"Arthur","year":"1992"},{"issue":"1","key":"10.1016\/0004-3702(94)00016-T_BIB7","doi-asserted-by":"crossref","DOI":"10.1016\/0020-0190(81)90074-0","article-title":"Solving combinatorial search problems by intelligent backtracking","volume":"12","author":"Bruynooghe","year":"1981","journal-title":"Inf. Process. Lett."},{"key":"10.1016\/0004-3702(94)00016-T_BIB8","author":"Cormen","year":"1990"},{"issue":"4","key":"10.1016\/0004-3702(94)00016-T_BIB9","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1145\/76359.76360","article-title":"Using temporal hierarchies to efficiently maintain large temporal databases","volume":"36","author":"Dean","year":"1989","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(94)00016-T_BIB10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0004-3702(87)90061-0","article-title":"Temporal data base management","volume":"32","author":"Dean","year":"1987","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(94)00016-T_BIB11","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":"Artif. Intell."},{"key":"10.1016\/0004-3702(94)00016-T_BIB12","series-title":"Proceedings AAAI-92","first-page":"735","article-title":"Temporal reasoning in sequence graphs,","author":"Dorn","year":"1992"},{"issue":"1\u20132","key":"10.1016\/0004-3702(94)00016-T_BIB13","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/0004-3702(94)90110-4","article-title":"On point-based temporal disjointness (Research Note)","volume":"70","author":"Gerevini","year":"1994","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(94)00016-T_BIB14","series-title":"Proceedings IJCAI-93","first-page":"648","article-title":"Efficient temporal reasoning through timegraphs","author":"Gerevini","year":"1993"},{"key":"10.1016\/0004-3702(94)00016-T_BIB15","series-title":"Proceedings Fourth International Conference on Principles of Knowledge Representation and Reasoning (KR94)","article-title":"An efficient method for managing disjunctions in qualitative temporal reasoning","author":"Gerevini","year":"1994"},{"key":"10.1016\/0004-3702(94)00016-T_BIB16","unstructured":"A. Gerevini and L. Schubert, On computing the minimal labels in time point algebra networks, Comput. Intell., to appear."},{"issue":"3","key":"10.1016\/0004-3702(94)00016-T_BIB17","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 Bull."},{"key":"10.1016\/0004-3702(94)00016-T_BIB18","series-title":"Proceedings IJCAI-89","first-page":"1297","article-title":"Managing efficiently temporal relations through indexed spanning trees","author":"Ghallab","year":"1989"},{"key":"10.1016\/0004-3702(94)00016-T_BIB19","series-title":"Proceedings AAAI-92","first-page":"741","article-title":"Algorithms and complexity for reasoning about time","author":"Golumbic","year":"1992"},{"key":"10.1016\/0004-3702(94)00016-T_BIB20","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1145\/321850.321857","article-title":"Unit refutations and Horn sets","volume":"21","author":"Henschen","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/0004-3702(94)00016-T_BIB21","series-title":"Reasoning about Plans","article-title":"A formal theory of plan recognition and its implementation","author":"Kautz","year":"1991"},{"key":"10.1016\/0004-3702(94)00016-T_BIB22","series-title":"Proceedings AAAI-91","article-title":"Integrating metric and qualitative temporal reasoning","author":"Kautz","year":"1991"},{"key":"10.1016\/0004-3702(94)00016-T_BIB23","article-title":"The timelogic temporal reasoning system","author":"Koomen","year":"1988"},{"key":"10.1016\/0004-3702(94)00016-T_BIB24","article-title":"On binary constraint networks","author":"Ladkin","year":"1988"},{"issue":"3","key":"10.1016\/0004-3702(94)00016-T_BIB25","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1145\/176584.176585","article-title":"On binary constraint problems","volume":"41","author":"Ladkin","year":"1994","journal-title":"J. ACM"},{"issue":"1","key":"10.1016\/0004-3702(94)00016-T_BIB26","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1016\/0004-3702(92)90106-8","article-title":"Effective solution of qualitative interval constraint problems","volume":"57","author":"Ladkin","year":"1992","journal-title":"Artif. Intell."},{"key":"10.1016\/0004-3702(94)00016-T_BIB27","series-title":"Proceedings AAAI-9I","article-title":"Combining qualitative and quantitative constraints in temporal reasoning","author":"Meiri","year":"1991"},{"key":"10.1016\/0004-3702(94)00016-T_BIB28","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1111\/j.1467-8640.1990.tb00294.x","article-title":"Time revisited","volume":"6","author":"Miller","year":"1990","journal-title":"Comput. Intell."},{"key":"10.1016\/0004-3702(94)00016-T_BIB29","article-title":"Reasoning about temporal relations: A maximal tractable subclass of Allen's interval algebra","author":"Nebel","year":"1993"},{"key":"10.1016\/0004-3702(94)00016-T_BIB30","article-title":"Temporally Distributed Symptoms in Technical Diagnosis","volume":"517","author":"N\u00f6kel","year":"1991"},{"key":"10.1016\/0004-3702(94)00016-T_BIB31","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/MC.1983.1654198","article-title":"Determining type, part, colour, and time relationships","volume":"6","author":"Schubert","year":"1983","journal-title":"Computer"},{"key":"10.1016\/0004-3702(94)00016-T_BIB32","series-title":"The Knowledge Frontier: Essays in the Representation of Knowledge","first-page":"187","article-title":"Accelerating deductive inference: special methods for taxonomies, colours, and times","author":"Schubert","year":"1987"},{"key":"10.1016\/0004-3702(94)00016-T_BIB33","author":"Shanahan","year":"1989"},{"key":"10.1016\/0004-3702(94)00016-T_BIB34","series-title":"Proceedings AAAI-88","first-page":"745","article-title":"The interpretation of temporal relations in a narrative","author":"Song","year":"1988"},{"key":"10.1016\/0004-3702(94)00016-T_BIB35","series-title":"Proceedings IJCAI-85","first-page":"1181","article-title":"Automated deduction by theory resolution","author":"Stickel","year":"1985"},{"issue":"2","key":"10.1016\/0004-3702(94)00016-T_BIB36","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1137\/0201010","article-title":"Depth first search and linear graph algorithms","volume":"1","author":"Tarjan","year":"1972","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0004-3702(94)00016-T_BIB37","series-title":"Proceedings AAAI-90","first-page":"728","article-title":"Reasoning about qualitative temporal information,","author":"van Beek","year":"1990"},{"issue":"1\u20133","key":"10.1016\/0004-3702(94)00016-T_BIB38","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0004-3702(92)90011-L","article-title":"Reasoning about qualitative temporal information","volume":"58","author":"van Beek","year":"1992","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0004-3702(94)00016-T_BIB39","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":"Comput. Intell."},{"key":"10.1016\/0004-3702(94)00016-T_BIB40","series-title":"Proceedings AAAI-86","first-page":"377","article-title":"Constraint propagation algorithms for temporal reasoning","author":"Vilain","year":"1986"},{"key":"10.1016\/0004-3702(94)00016-T_BIB41","series-title":"Readings in Qualitative Reasoning about Physical Systems","first-page":"373","article-title":"Constraint propagation algorithms for temporal reasoning: a revised report","author":"Vilain","year":"1990"},{"key":"10.1016\/0004-3702(94)00016-T_BIB42","series-title":"Proceedings Third International Conference on Principles of Knowledge Representation and Reasoning","first-page":"282","article-title":"Terminological reasoning with constraint networks and an application to plan recognition","author":"Weida","year":"1992"},{"issue":"3","key":"10.1016\/0004-3702(94)00016-T_BIB43","doi-asserted-by":"crossref","DOI":"10.1145\/152947.152954","article-title":"Performance of temporal reasoning systems","volume":"4","author":"Yampratoom","year":"1993","journal-title":"SIGART Bull."}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:000437029400016T?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:000437029400016T?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,3]],"date-time":"2025-09-03T14:18:44Z","timestamp":1756909124000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/000437029400016T"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,4]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,4]]}},"alternative-id":["000437029400016T"],"URL":"https:\/\/doi.org\/10.1016\/0004-3702(94)00016-t","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1995,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Efficient algorithms for qualitative reasoning about time","name":"articletitle","label":"Article Title"},{"value":"Artificial Intelligence","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0004-3702(94)00016-T","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1995 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}