{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T03:06:18Z","timestamp":1761620778810},"reference-count":34,"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)00223-0","type":"journal-article","created":{"date-parts":[[2002,9,9]],"date-time":"2002-09-09T20:43:49Z","timestamp":1031604229000},"page":"107-152","source":"Crossref","is-referenced-by-count":33,"title":["Solving multi-granularity temporal constraint networks"],"prefix":"10.1016","volume":"140","author":[{"given":"Claudio","family":"Bettini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"X.Sean","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sushil","family":"Jajodia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"11","key":"10.1016\/S0004-3702(02)00223-0_BIB001","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"},{"issue":"1","key":"10.1016\/S0004-3702(02)00223-0_BIB002","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1006\/inco.1993.1025","article-title":"Real-time logics: Complexity and expressiveness","volume":"104","author":"Alur","year":"1993","journal-title":"Inform. and Comput."},{"issue":"6","key":"10.1016\/S0004-3702(02)00223-0_BIB003","doi-asserted-by":"crossref","first-page":"948","DOI":"10.1109\/69.824613","article-title":"Qualitative and quantitative temporal constraints and relational databases: Theory, architecture, and applications","volume":"11","author":"Brusoni","year":"1999","journal-title":"IEEE Trans. Knowledge Data Engrg."},{"key":"10.1016\/S0004-3702(02)00223-0_BIB004","series-title":"Temporal Databases: Research and Practice","first-page":"406","article-title":"A glossary of time granularity concepts","volume":"1399","author":"Bettini","year":"1998"},{"issue":"1","key":"10.1016\/S0004-3702(02)00223-0_BIB005","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1016\/0004-3702(94)90041-8","article-title":"Arc-consistency and arc-consistency again","volume":"65","author":"Bessi\u00e8re","year":"1994","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00223-0_BIB006","series-title":"Proc. 3rd International Conference on Principles and Practice of Constraint Programming","first-page":"435","article-title":"Satisfiability of quantitative temporal constraints with multiple granularities","volume":"1330","author":"Bettini","year":"1997"},{"issue":"1,2","key":"10.1016\/S0004-3702(02)00223-0_BIB007","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1023\/A:1018938007511","article-title":"A general framework for time granularity and its application to temporal reasoning","volume":"22","author":"Bettini","year":"1998","journal-title":"Ann. Math. Artificial Intelligence"},{"issue":"2","key":"10.1016\/S0004-3702(02)00223-0_BIB008","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1109\/69.683754","article-title":"Discovering temporal relationships with multiple granularities in time sequences","volume":"10","author":"Bettini","year":"1998","journal-title":"IEEE Trans. Knowledge Data Engrg."},{"key":"10.1016\/S0004-3702(02)00223-0_BIB009","doi-asserted-by":"crossref","unstructured":"C. Bettini, X.S. Wang, S. Jajodia, Temporal reasoning in workflow systems, Distributed and Parallel Databases 11 (3) (2002) 269\u2013306","DOI":"10.1023\/A:1014048800604"},{"issue":"5","key":"10.1016\/S0004-3702(02)00223-0_BIB010","doi-asserted-by":"crossref","first-page":"826","DOI":"10.1145\/355483.355485","article-title":"Building tractable disjunctive constraints","volume":"47","author":"Cohen","year":"2000","journal-title":"J. ACM"},{"year":"1997","series-title":"Parameterized Complexity","author":"Downey","key":"10.1016\/S0004-3702(02)00223-0_BIB011"},{"key":"10.1016\/S0004-3702(02)00223-0_BIB012","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":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00223-0_BIB013","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"},{"year":"1979","series-title":"Computers and Intractability\u2014A Guide to the Theory of NP-completeness","author":"Garey","key":"10.1016\/S0004-3702(02)00223-0_BIB014"},{"issue":"5","key":"10.1016\/S0004-3702(02)00223-0_BIB015","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(02)00223-0_BIB016","unstructured":"S. Gotta, A web interface for a multi-granularity temporal constraint solver, Master Thesis, University of Milan, Italy, 2000 (in Italian)"},{"issue":"1","key":"10.1016\/S0004-3702(02)00223-0_BIB017","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/S0004-3702(98)00031-9","article-title":"A unifying approach to temporal constraint reasoning","volume":"102","author":"Jonsson","year":"1998","journal-title":"Artificial Intelligence"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(02)00223-0_BIB018","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/S0004-3702(00)00055-2","article-title":"Querying temporal and spatial constraint networks in PTIME","volume":"123","author":"Koubarakis","year":"2000","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00223-0_BIB019","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1006\/jcss.1995.1049","article-title":"Handling infinite temporal data","volume":"51","author":"Kabanza","year":"1995","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0004-3702(02)00223-0_BIB020","series-title":"Proc. IJCAI-87, Milan, Italy","first-page":"462","article-title":"The completeness of a natural system for reasoning with time intervals","author":"Ladkin","year":"1987"},{"key":"10.1016\/S0004-3702(02)00223-0_BIB021","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"},{"key":"10.1016\/S0004-3702(02)00223-0_BIB022","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/0004-3702(95)00109-3","article-title":"Combining qualitative and quantitative constraints in temporal reasoning","volume":"87","author":"Meiri","year":"1996","journal-title":"Artificial Intelligence"},{"issue":"2","key":"10.1016\/S0004-3702(02)00223-0_BIB023","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0004-3702(86)90083-4","article-title":"Arc and path consistency revisited","volume":"28","author":"Mohr","year":"1986","journal-title":"Artificial Intelligence"},{"issue":"2","key":"10.1016\/S0004-3702(02)00223-0_BIB024","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0020-0255(74)90008-5","article-title":"Networks of constraints: Fundamental properties and applications to picture processing","volume":"7","author":"Montanari","year":"1974","journal-title":"Inform. Sci."},{"key":"10.1016\/S0004-3702(02)00223-0_BIB025","doi-asserted-by":"crossref","unstructured":"A. Montanari, Metric and layered temporal logic for time granularity, PhD Dissertation, ILLC-1996-02, Institute for Logic, Language and Computation, University of Amsterdam, 1996","DOI":"10.1305\/ndjfl\/1040046089"},{"key":"10.1016\/S0004-3702(02)00223-0_BIB026","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0004-3702(85)90041-4","article-title":"The complexity of some polynomial network consistency algorithms for constraint satisfaction problems","volume":"25","author":"Mackworth","year":"1985","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00223-0_BIB027","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1111\/j.1467-8640.1985.tb00064.x","article-title":"Hierarchical arc consistency: Exploiting structured domains in constraint satisfaction problems","volume":"1","author":"Mackworth","year":"1985","journal-title":"Comput. Intelligence"},{"key":"10.1016\/S0004-3702(02)00223-0_BIB028","series-title":"Proc. IJCAI-93, Chambery, France","first-page":"655","article-title":"Path consistency in a network of non-convex intervals","author":"Morris","year":"1993"},{"issue":"1","key":"10.1016\/S0004-3702(02)00223-0_BIB029","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)00223-0_BIB030","series-title":"Proc. AAAI-91, Anaheim, CA","first-page":"253","article-title":"Metric constraints for maintaining appointments: Dates and repeated activities","author":"Poesio","year":"1991"},{"key":"10.1016\/S0004-3702(02)00223-0_BIB031","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/S0004-3702(97)00009-X","article-title":"Processing disjunctions in temporal constraint networks","volume":"93","author":"Schwalb","year":"1997","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(02)00223-0_BIB032","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. Intelligence"},{"key":"10.1016\/S0004-3702(02)00223-0_BIB033","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"},{"issue":"2","key":"10.1016\/S0004-3702(02)00223-0_BIB034","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1145\/249978.249979","article-title":"Logical design for temporal databases with multiple granularities","volume":"22","author":"Wang","year":"1997","journal-title":"ACM Trans. Database Systems"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370202002230?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370202002230?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T17:50:57Z","timestamp":1555177857000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370202002230"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":34,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["S0004370202002230"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(02)00223-0","relation":{},"ISSN":["0004-3702"],"issn-type":[{"type":"print","value":"0004-3702"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}