{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:24:24Z","timestamp":1761611064492},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"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":[[1998,4]]},"DOI":"10.1016\/s0020-0190(98)00027-1","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"7-11","source":"Crossref","is-referenced-by-count":8,"title":["Non-elementary lower bound for Propositional Duration Calculus"],"prefix":"10.1016","volume":"66","author":[{"given":"A.","family":"Rabinovich","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(98)00027-1_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0168-0072(90)90080-L","article-title":"A uniform method for proving lower bounds on the computational complexity of logical theories","volume":"48","author":"Compton","year":"1990","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0020-0190(98)00027-1_BIB2","article-title":"Nicht-elementare untere Schranken in der Automaten-theorie","author":"F\u00fcrer","year":"1978"},{"key":"10.1016\/S0020-0190(98)00027-1_BIB3","series-title":"Proc. Logic in Comput. Sci.","first-page":"279","article-title":"A propositional modal logic of time intervals","author":"Halperin","year":"1986"},{"issue":"3","key":"10.1016\/S0020-0190(98)00027-1_BIB4","doi-asserted-by":"crossref","first-page":"872","DOI":"10.1145\/177492.177726","article-title":"The temporal logic of actions","volume":"16","author":"Lamport","year":"1994","journal-title":"ACM Trans. Programm. Languages Systems"},{"key":"10.1016\/S0020-0190(98)00027-1_BIB5","series-title":"Counter-free Automata","author":"McNaughton","year":"1971"},{"key":"10.1016\/S0020-0190(98)00027-1_BIB6","series-title":"Proceedings of EXPRESS","article-title":"On expressive completeness of Duration and Mean Value Calculi","volume":"Vol. 7","author":"Rabinovich","year":"1997"},{"key":"10.1016\/S0020-0190(98)00027-1_BIB7","doi-asserted-by":"crossref","DOI":"10.1109\/32.210306","article-title":"Specifying and verifying requirement of real time systems","author":"Ravn","year":"1993","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/S0020-0190(98)00027-1_BIB8","unstructured":"P. Sestoft, Personal communication."},{"key":"10.1016\/S0020-0190(98)00027-1_BIB9","series-title":"Workshop on Real Time Systems","article-title":"Specification of embedded real time systems","author":"Skakkebak","year":"1992"},{"key":"10.1016\/S0020-0190(98)00027-1_BIB10","article-title":"The complexity of decision problems in automata and logic","author":"Stockmeyer","year":"1974"},{"key":"10.1016\/S0020-0190(98)00027-1_BIB11","series-title":"Proc. 5th AMS Symposium on Theory of Computing","author":"Stockmeyer","year":"1973"},{"key":"10.1016\/S0020-0190(98)00027-1_BIB12","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1007\/BF01211086","article-title":"Duration Calculus: logical foundations","volume":"9","author":"Chaochen","year":"1997","journal-title":"Formal Aspects of Computing"},{"key":"10.1016\/S0020-0190(98)00027-1_BIB13","series-title":"STACS'93","first-page":"58","article-title":"Decidability and undecidability results for Duration Calculus","volume":"Vol. 665","author":"Chaochen","year":"1993"},{"issue":"5","key":"10.1016\/S0020-0190(98)00027-1_BIB14","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0020-0190(91)90122-X","article-title":"A calculus of Duration","volume":"40","author":"Chaochen","year":"1991","journal-title":"Inform. Process. Lett."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000271?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019098000271?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T10:27:00Z","timestamp":1556274420000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019098000271"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["S0020019098000271"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(98)00027-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}