{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:07:44Z","timestamp":1760202464617},"reference-count":15,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2002,5,1]],"date-time":"2002-05-01T00:00:00Z","timestamp":1020211200000},"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,5]]},"DOI":"10.1016\/s0020-0190(01)00260-5","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T17:55:05Z","timestamp":1034618105000},"page":"123-129","source":"Crossref","is-referenced-by-count":11,"title":["Quantified Computation Tree Logic"],"prefix":"10.1016","volume":"82","author":[{"given":"A.C.","family":"Patthak","sequence":"first","affiliation":[]},{"given":"I.","family":"Bhattacharya","sequence":"additional","affiliation":[]},{"given":"A.","family":"Dasgupta","sequence":"additional","affiliation":[]},{"given":"Pallab","family":"Dasgupta","sequence":"additional","affiliation":[]},{"given":"P.P.","family":"Chakrabarti","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0020-0190(01)00260-5_BIB001","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1093\/jigpal\/8.3.325","article-title":"Reachability Logic: An efficient fragment of transitive closure logic","volume":"8","author":"Alechina","year":"2000","journal-title":"Logic J. IGPL"},{"key":"10.1016\/S0020-0190(01)00260-5_BIB002","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1018985923441","article-title":"Planning for temporally extended goals","volume":"22","author":"Bacchus","year":"1998","journal-title":"Ann. of Math. Artificial Intelligence"},{"key":"10.1016\/S0020-0190(01)00260-5_BIB003","series-title":"Proc. Workshop on Logic of Programs","first-page":"52","article-title":"Design and synthesis of synchronization skeletons using branching time temporal logic","volume":"131","author":"Clarke","year":"1981"},{"issue":"2","key":"10.1016\/S0020-0190(01)00260-5_BIB004","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. Prog. Lang. Systems"},{"issue":"6","key":"10.1016\/S0020-0190(01)00260-5_BIB005","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1109\/6.499951","article-title":"Computer aided verification","volume":"33","author":"Clarke","year":"1996","journal-title":"IEEE Spectrum"},{"key":"10.1016\/S0020-0190(01)00260-5_BIB006","series-title":"Model Checking","author":"Clarke","year":"2000"},{"key":"10.1016\/S0020-0190(01)00260-5_BIB007","series-title":"Proc. 5th European Conf. on Planning","first-page":"228","article-title":"Automata-theoretic approach to planning for temporally extended goals","author":"De Giacomo","year":"1999"},{"key":"10.1016\/S0020-0190(01)00260-5_BIB008","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/S0019-9958(86)80029-8","article-title":"Relational queries computable in polynomial time","volume":"68","author":"Immerman","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/S0020-0190(01)00260-5_BIB009","series-title":"Proc. of CAV'97","first-page":"291","article-title":"Model checking and transitive closure logic","author":"Immerman","year":"1997"},{"issue":"2","key":"10.1016\/S0020-0190(01)00260-5_BIB010","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1093\/logcom\/9.2.135","article-title":"Augmenting branching temporal logics with existential quantification over atomic propositions","volume":"9","author":"Kupferman","year":"1999","journal-title":"J. Logic Comput."},{"key":"10.1016\/S0020-0190(01)00260-5_BIB011","series-title":"Proc. 12th POPL","first-page":"97","article-title":"Checking that finite state concurrent programs satisfy their linear specification","author":"Lichtenstein","year":"1985"},{"key":"10.1016\/S0020-0190(01)00260-5_BIB012","series-title":"Computational Complexity","author":"Papadimitriou","year":"1994"},{"key":"10.1016\/S0020-0190(01)00260-5_BIB013","series-title":"STOC'82","first-page":"137","article-title":"Complexity of relational query languages","author":"Vardi","year":"1982"},{"key":"10.1016\/S0020-0190(01)00260-5_BIB014","series-title":"Computer Science Today: Recent Trends and Developments","article-title":"Alternating automata and program verification","volume":"1000","author":"Vardi","year":"1995"},{"key":"10.1016\/S0020-0190(01)00260-5_BIB015","series-title":"Introduction to Graph Theory","author":"West","year":"1996"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002605?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019001002605?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,2]],"date-time":"2019-05-02T05:52:37Z","timestamp":1556776357000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019001002605"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,5]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2002,5]]}},"alternative-id":["S0020019001002605"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(01)00260-5","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2002,5]]}}}