{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:46:04Z","timestamp":1762458364529},"reference-count":43,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"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":3613,"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":[[2003,10]]},"DOI":"10.1016\/s0004-3702(03)00075-4","type":"journal-article","created":{"date-parts":[[2003,7,7]],"date-time":"2003-07-07T13:47:57Z","timestamp":1057585677000},"page":"179-220","source":"Crossref","is-referenced-by-count":17,"title":["Point algebras for temporal reasoning: Algorithms and complexity"],"prefix":"10.1016","volume":"149","author":[{"given":"Mathias","family":"Broxvall","sequence":"first","affiliation":[]},{"given":"Peter","family":"Jonsson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"11","key":"10.1016\/S0004-3702(03)00075-4_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(03)00075-4_BIB002","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF00117599","article-title":"The lattice structure of temporal interval relations","volume":"6","author":"Anger","year":"1996","journal-title":"J. Appl. Intelligence"},{"issue":"3","key":"10.1016\/S0004-3702(03)00075-4_BIB003","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1145\/65979.65982","article-title":"On Lamport's interprocessor communication model","volume":"11","author":"Anger","year":"1989","journal-title":"ACM Trans. Programming Lang. Syst."},{"key":"10.1016\/S0004-3702(03)00075-4_BIB004","unstructured":"F.D. Anger, D. Mitra, R.V. Rodriguez, Temporal constraint networks in nonlinear time, Technical Report, ECAI Workshop on Temporal and Spatial Reasoning, Brighton, UK, 1998"},{"key":"10.1016\/S0004-3702(03)00075-4_BIB005","series-title":"Computer Algorithms: Introduction to Design and Analysis","author":"Baase","year":"1988"},{"key":"10.1016\/S0004-3702(03)00075-4_BIB006","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1002\/net.3230020103","article-title":"Partial orders of dimension 2","volume":"2","author":"Baker","year":"1972","journal-title":"Networks"},{"key":"10.1016\/S0004-3702(03)00075-4_BIB007","series-title":"Proceedings of the Joint German\/Austrian Conference on Artificial Intelligence (KI-2001) Vienna, Austria","article-title":"The point algebra for branching time revisited","author":"Broxvall","year":"2001"},{"key":"10.1016\/S0004-3702(03)00075-4_BIB008","series-title":"Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming, Alexandria, VA","first-page":"129","article-title":"Towards a complete classification of tractability in point algebras for nonlinear time","author":"Broxvall","year":"1999"},{"key":"10.1016\/S0004-3702(03)00075-4_BIB009","series-title":"Proceedings of 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(03)00075-4_BIB010","series-title":"Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming, Singapore","first-page":"114","article-title":"Refinements and independence: A simple method for identifying tractable disjunctive constraints","author":"Broxvall","year":"2000"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(03)00075-4_BIB011","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/S0004-3702(02)00224-2","article-title":"Disjunctions, independence, refinements","volume":"140","author":"Broxvall","year":"2002","journal-title":"Artificial Intelligence"},{"issue":"2","key":"10.1016\/S0004-3702(03)00075-4_BIB012","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1145\/5397.5399","article-title":"Automatic verification of finite-state concurrent systems using temporal logic specifications","volume":"8","author":"Clarke","year":"1986","journal-title":"ACM Trans. Programming Lang. Syst."},{"issue":"5","key":"10.1016\/S0004-3702(03)00075-4_BIB013","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":"3","key":"10.1016\/S0004-3702(03)00075-4_BIB014","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S0747-7171(08)80013-2","article-title":"Matrix multiplication via arithmetic progressions","volume":"9","author":"Coppersmith","year":"1990","journal-title":"Symbolic Comput."},{"key":"10.1016\/S0004-3702(03)00075-4_BIB015","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1016\/0004-3702(88)90087-2","article-title":"Reasoning about partially ordered events","volume":"36","author":"Dean","year":"1988","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(03)00075-4_BIB016","series-title":"Proceedings of IJCAI-99, Stockholm, Sweden","first-page":"166","article-title":"Expressive reasoning about action in nondeterministic polynomial time","author":"Drakengren","year":"1999"},{"issue":"1","key":"10.1016\/S0004-3702(03)00075-4_BIB017","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0004-3702(99)00065-X","article-title":"Reasoning about action in polynomial time","volume":"115","author":"Drakengren","year":"1999","journal-title":"Artificial Intelligence"},{"issue":"3","key":"10.1016\/S0004-3702(03)00075-4_BIB018","doi-asserted-by":"crossref","first-page":"229","DOI":"10.3233\/FI-1999-39301","article-title":"Relations algebras in qualitative spatial reasoning","volume":"39","author":"D\u00fcntsch","year":"1999","journal-title":"Fundamenta Informaticae"},{"issue":"1","key":"10.1016\/S0004-3702(03)00075-4_BIB019","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1145\/4904.4999","article-title":"\u201cSometimes\u201d and \u201cnot never\u201d revisited: On branching versus linear temporal logic","volume":"33","author":"Emerson","year":"1986","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(03)00075-4_BIB020","series-title":"Proceedings of REX Workshop","first-page":"123","article-title":"Branching time temporal logic","author":"Emerson","year":"1988"},{"key":"10.1016\/S0004-3702(03)00075-4_BIB021","series-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency, New York","first-page":"123","article-title":"Branching time temporal logic","author":"Emerson","year":"1989"},{"key":"10.1016\/S0004-3702(03)00075-4_BIB022","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"5","key":"10.1016\/S0004-3702(03)00075-4_BIB023","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"},{"issue":"3","key":"10.1016\/S0004-3702(03)00075-4_BIB024","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1093\/logcom\/7.3.309","article-title":"Expressive power and complexity in algebraic logic","volume":"7","author":"Hirsch","year":"1997","journal-title":"J. Logic Comput."},{"key":"10.1016\/S0004-3702(03)00075-4_BIB025","series-title":"Proceedings of AAAI-96, Portland, OR","first-page":"1235","article-title":"A linear-programming approach to temporal reasoning","author":"Jonsson","year":"1996"},{"issue":"1","key":"10.1016\/S0004-3702(03)00075-4_BIB026","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(03)00075-4_BIB027","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/S0004-3702(99)00007-7","article-title":"Computational complexity of relating time points with intervals","volume":"109","author":"Jonsson","year":"1999","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(03)00075-4_BIB028","series-title":"Proceedings of the 2nd Conference on Principles and Practice of Constraint Programming (CP'96), Boston, MA","first-page":"297","article-title":"Tractable disjunctions of linear constraints","author":"Koubarakis","year":"1996"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(03)00075-4_BIB029","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1016\/S0304-3975(00)00177-8","article-title":"Tractable disjunctions of linear constraints: basic results and applications to temporal reasoning","volume":"266","author":"Koubarakis","year":"2001","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0004-3702(03)00075-4_BIB030","unstructured":"A. Krokhin, P. Jeavons, P. Jonsson, Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra, Technical Report PRG-RR-01-12, Computing Laboratory, Oxford University, 2001, Available from http:\/\/web.comlab.ox.ac.uk\/oucl\/publications\/tr\/rr-01-12.html"},{"issue":"7","key":"10.1016\/S0004-3702(03)00075-4_BIB031","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1145\/359545.359563","article-title":"Time, clocks and the ordering of events in a distributed system","volume":"21","author":"Lamport","year":"1978","journal-title":"Comm. ACM"},{"issue":"2","key":"10.1016\/S0004-3702(03)00075-4_BIB032","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1145\/5383.5384","article-title":"The mutual exclusion problem: Part I\u2014A theory of interprocess communication","volume":"33","author":"Lamport","year":"1986","journal-title":"J. ACM"},{"key":"10.1016\/S0004-3702(03)00075-4_BIB033","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1207\/s15516709cog0602_1","article-title":"A temporal logic for reasoning about processes and plans","volume":"6","author":"McDermott","year":"1982","journal-title":"Cognitive Sci."},{"key":"10.1016\/S0004-3702(03)00075-4_BIB034","unstructured":"K.L. McMillan, Symbolic Model Checking. An approach to the state explosion problem, PhD Thesis, Carnegie-Mellon University, Pittsburgh, PA, 1992"},{"issue":"1","key":"10.1016\/S0004-3702(03)00075-4_BIB035","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(03)00075-4_BIB036","series-title":"Theory of Graphs","author":"Ore","year":"1962"},{"key":"10.1016\/S0004-3702(03)00075-4_BIB037","series-title":"Proceedings of IJCAI-99","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(03)00075-4_BIB038","series-title":"Proceedings of IJCAI-2001, Seattle, WA","first-page":"51","article-title":"A spatial odyssey of the interval algebra: 1. Directed intervals","author":"Renz","year":"2001"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(03)00075-4_BIB039","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"},{"key":"10.1016\/S0004-3702(03)00075-4_BIB040","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1023\/A:1009725727148","article-title":"Using constraint propagation to reason about unsynchronized clocks","volume":"2","author":"Rodriguez","year":"1998","journal-title":"Constraints"},{"key":"10.1016\/S0004-3702(03)00075-4_BIB041","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":"1989"},{"key":"10.1016\/S0004-3702(03)00075-4_BIB042","series-title":"Linear Time, Branching Time and Partial Order in Logics and Models for Concurrency","first-page":"364","article-title":"An introduction to event structures","author":"Winskell","year":"1989"},{"issue":"3","key":"10.1016\/S0004-3702(03)00075-4_BIB043","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1137\/0603036","article-title":"The complexity of the partial order dimension problem","volume":"3","author":"Yannakakis","year":"1982","journal-title":"SIAM J. Alg. Disc. Meth."}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370203000754?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370203000754?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,24]],"date-time":"2020-03-24T17:00:09Z","timestamp":1585069209000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370203000754"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["S0004370203000754"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(03)00075-4","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}