{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:05:52Z","timestamp":1761620752488},"reference-count":8,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2002,6,1]],"date-time":"2002-06-01T00:00:00Z","timestamp":1022889600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2002,6]]},"DOI":"10.1016\/s0020-0190(01)00278-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:36:07Z","timestamp":1027607767000},"page":"261-268","source":"Crossref","is-referenced-by-count":4,"title":["Updating \u2a7d,<-chains"],"prefix":"10.1016","volume":"82","author":[{"given":"James P.","family":"Delgrande","sequence":"first","affiliation":[]},{"given":"Arvind","family":"Gupta","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(01)00278-2_BIB001","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"key":"10.1016\/S0020-0190(01)00278-2_BIB002","series-title":"Introduction to Algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0020-0190(01)00278-2_BIB003","series-title":"Advances in Database Technology\u2014EDBT 2000, 7th International Conference on Extending Database Technology","first-page":"237","article-title":"The dynamic data cube","volume":"1777","author":"Geffner","year":"2000"},{"key":"10.1016\/S0020-0190(01)00278-2_BIB004","series-title":"Proc. 19th Annual IEEE Symp. on Foundations of Computer Science","first-page":"8","article-title":"A dichromatic framework for balanced trees","author":"Guibas","year":"1978"},{"issue":"2","key":"10.1016\/S0020-0190(01)00278-2_BIB005","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/0004-3702(94)00016-T","article-title":"Efficient algorithms for qualitative reasoning about time","volume":"74","author":"Gerevini","year":"1995","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0020-0190(01)00278-2_BIB006","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. Intelligence"},{"key":"10.1016\/S0020-0190(01)00278-2_BIB007","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\/S0020-0190(01)00278-2_BIB008","series-title":"Proceedings of the 17th International Conference on Data Engineering, Heidelberg, Germany","first-page":"51","article-title":"Incremental computation and maintenance of temporal aggregates","author":"Yang","year":"2001"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002782?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002782?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T04:54:14Z","timestamp":1556427254000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001002782"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,6]]},"references-count":8,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2002,6]]}},"alternative-id":["S0020019001002782"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00278-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,6]]}}}