{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T08:24:57Z","timestamp":1770279897092,"version":"3.49.0"},"reference-count":26,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/time.2003.1214884","type":"proceedings-article","created":{"date-parts":[[2004,1,23]],"date-time":"2004-01-23T23:33:03Z","timestamp":1074900783000},"page":"91-98","source":"Crossref","is-referenced-by-count":17,"title":["On the computational complexity of decidable fragments of first-order linear temporal logics"],"prefix":"10.1109","author":[{"given":"I.","family":"Hodkinson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Kontchakov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Kurucz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F.","family":"Wolter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M.","family":"Zakharyaschev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(89)90039-1"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0168-0072(00)00018-X"},{"key":"ref12","first-page":"657","article-title":"What good is temporal logic","author":"lamport","year":"1983","journal-title":"Information Processing 83"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011207512025"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/9.6.897"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF00713542"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1305\/ndjfl\/1039700748"},{"key":"ref17","author":"reynolds","year":"1999","journal-title":"The complexity of the temporal logic over the reals"},{"key":"ref18","article-title":"The complexity of the temporal logic with until over general linear time","author":"reynolds","year":"2002","journal-title":"Journal of Computer and System Science"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/11.6.909"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/322234.322243"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59207-2"},{"key":"ref6","author":"gabbay","year":"2003","journal-title":"Many-Dimensional Modal Logics Theory and Applications"},{"key":"ref5","first-page":"331","article-title":"The convenience of tilings","author":"van emde boas","year":"1997","journal-title":"Complexity Logic and Recursion Theory volume 187 of Lecture Notes in Pure and Applied Mathematics"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.2307\/2586808"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1093\/jigpal\/6.1.73"},{"key":"ref2","first-page":"98","article-title":"A temporal description logic for reasoning about conceptual schemas and queries","author":"artale","year":"2002","journal-title":"Proceedings of JELIA'02 volume 2424 of Lecture Notes in Computer Science"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/174644.174651"},{"key":"ref9","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/3-540-48660-7_3","article-title":"Decision procedures for guarded logics. In Automated Deduction - CADE16, volume 1632 of LNCS","author":"gr\u00e4del","year":"1999","journal-title":"16th International Conference on Automated Deduction"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(70)80006-X"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3837"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-57287-2_41"},{"key":"ref24","first-page":"153","article-title":"On the eventuality operator in temporal logic","author":"sistla","year":"1987","journal-title":"Proceedings of the Second IEEE Symposion on Logic in Computer Science (LICS'87)"},{"key":"ref23","first-page":"138","article-title":"Reasoning with many processes","author":"sistla","year":"1987","journal-title":"Proceedings of the Second IEEE Symposium on Logic in Computer Science"},{"key":"ref26","first-page":"379","article-title":"Temporalizing description logics","author":"wolter","year":"2000","journal-title":"Frontiers of Combining Systems"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1002\/malq.19960420140"}],"event":{"name":"10th International Symposium on Temporal Representation and Reasoning and Fourth International Conference on Temporal Logic. TIME-ICTL 2003","location":"Cairns, Qld., Australia","acronym":"TIME-03"},"container-title":["10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8624\/27321\/01214884.pdf?arnumber=1214884","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,29]],"date-time":"2020-03-29T03:52:45Z","timestamp":1585453965000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1214884\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/time.2003.1214884","relation":{},"subject":[]}}