{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,29]],"date-time":"2026-07-29T02:20:33Z","timestamp":1785291633854,"version":"3.55.0"},"reference-count":27,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1980,4,1]],"date-time":"1980-04-01T00:00:00Z","timestamp":323395200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":12160,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1980,4]]},"DOI":"10.1016\/0022-0000(80)90061-6","type":"journal-article","created":{"date-parts":[[2003,12,3]],"date-time":"2003-12-03T11:59:35Z","timestamp":1070452775000},"page":"231-254","source":"Crossref","is-referenced-by-count":104,"title":["A near-optimal method for reasoning about action"],"prefix":"10.1016","volume":"20","author":[{"given":"Vaughan R.","family":"Pratt","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"No. 3","key":"10.1016\/0022-0000(80)90061-6_BIB1","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1109\/TSE.1975.6312858","article-title":"Strong verification of programs","volume":"SE-1","author":"Basu","year":"1975","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0022-0000(80)90061-6_BIB2","series-title":"The Foundations of Mathematics","author":"Beth","year":"1959"},{"key":"10.1016\/0022-0000(80)90061-6_BIB3","series-title":"Proceedings, 17th IEEE Symposium on Foundations of Comp. Sci.","first-page":"98","article-title":"Alternation","author":"Chandra","year":"1976"},{"key":"10.1016\/0022-0000(80)90061-6_BIB4","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/321623.321625","article-title":"Characterization of pushdown machines in terms of time bounded computers","volume":"18","author":"Cook","year":"1971","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(80)90061-6_BIB5","series-title":"A Discipline of Programming","author":"Dijkstra","year":"1976"},{"key":"10.1016\/0022-0000(80)90061-6_BIB6","series-title":"Proceedings, 9th Ann. ACM Symp. on Theory of Computing","first-page":"286","article-title":"Propositional modal logic of programs","author":"Fischer","year":"1977"},{"key":"10.1016\/0022-0000(80)90061-6_BIB7","series-title":"Propositional dynamic logic of regular programs, manuscript","author":"Fischer","year":"1977"},{"key":"10.1016\/0022-0000(80)90061-6_BIB8","series-title":"Axiomatizations of logics of programs","author":"Gabbay","year":"1977"},{"key":"10.1016\/0022-0000(80)90061-6_BIB9_1","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/BF01201353","article-title":"Untersuchungen \u00fcber das Logische Schliessen","volume":"39","author":"Gentzen","year":"1934","journal-title":"Math. Z."},{"key":"10.1016\/0022-0000(80)90061-6_BIB9_2","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/BF01201363","article-title":"Untersuchungen \u00fcber das Logische Schliessen","volume":"39","author":"Gentzen","year":"1934","journal-title":"Math. Z."},{"key":"10.1016\/0022-0000(80)90061-6_BIB9_3","series-title":"The Collected Papers of G. Gentzen","first-page":"69","article-title":"Investigations into logical deduction","year":"1969"},{"key":"10.1016\/0022-0000(80)90061-6_BIB10","first-page":"7","article-title":"Form and content in quantification theory","volume":"8","author":"Hintieica","year":"1955","journal-title":"Acta Philos. Fenn."},{"key":"10.1016\/0022-0000(80)90061-6_BIB11","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1145\/363235.363259","article-title":"An axiomatic basis for computer programming","volume":"12","author":"Hoare","year":"1969","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(80)90061-6_BIB12","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1145\/361227.361231","article-title":"The intrinsically exponential complexity problem for attribute grammars","volume":"18","author":"Jazayeri","year":"1975","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(80)90061-6_BIB13","series-title":"Proceedings, 17th IEEE Symp. on Foundations of Comp. Sci.","first-page":"89","article-title":"On parallelism in Turing machines","author":"Kozen","year":"1976"},{"key":"10.1016\/0022-0000(80)90061-6_BIB14","series-title":"Proceedings, 19th Annual Symposium on Foundations of Computer Science","article-title":"Complexity of solvable cases of the decision problem for the predicate calculus","author":"Lewis","year":"1978"},{"key":"10.1016\/0022-0000(80)90061-6_BIB15","article-title":"Equivalence of DL, DL + and ADL for Regular Programs with Array Assignments","author":"Meyer","year":"1977"},{"key":"10.1016\/0022-0000(80)90061-6_BIB16","doi-asserted-by":"crossref","first-page":"718","DOI":"10.1137\/0206052","article-title":"Prospects and limitations of automatic assertion generation for loop programs","volume":"6","author":"Misra","year":"1977","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0022-0000(80)90061-6_BIB17","series-title":"Proceedings, Symp. on Mathematical Foundations of Computer Science","article-title":"A completeness result for PDL","author":"Parikh","year":"1978"},{"key":"10.1016\/0022-0000(80)90061-6_BIB18","series-title":"Proceedings, 17th Ann. IEEE Symp. on Foundations of Comp. Sci.","first-page":"109","article-title":"Semantical considerations on Floyd-Hoare logic","author":"Pratt","year":"1976"},{"key":"10.1016\/0022-0000(80)90061-6_BIB19","series-title":"Proceedings, 10th Ann. ACM Symp. on Theory of Computing","first-page":"326","article-title":"A practical decision method for propositional dynamic logic","author":"Pratt","year":"1977"},{"key":"10.1016\/0022-0000(80)90061-6_BIB20","series-title":"Proceedings, 20th IEEE Conference on Foundations of Computer Science","article-title":"Models of program logics","author":"Pratt","year":"1979"},{"key":"10.1016\/0022-0000(80)90061-6_BIB21","first-page":"A","article-title":"A completeness theorem in the modal logic of programs, Preliminary report","volume":"24","author":"Segerberg","year":"1977","journal-title":"Notices Amer. Math. Soc."},{"key":"10.1016\/0022-0000(80)90061-6_BIB22","series-title":"First-Order Logic","author":"Smullyan","year":"1968"},{"key":"10.1016\/0022-0000(80)90061-6_BIB23","doi-asserted-by":"crossref","first-page":"303","DOI":"10.2307\/2270448","article-title":"Trees and nest structures","volume":"31","author":"Smullyan","year":"1966","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0022-0000(80)90061-6_BIB24","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1145\/360827.360850","article-title":"The synthesis of loop predicates","volume":"17","author":"Wegbreit","year":"1974","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(80)90061-6_BIB25","article-title":"Equivalence of DL and DL+ for Regular Programs","author":"Winklmann","year":"1978"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000080900616?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000080900616?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T15:53:40Z","timestamp":1550332420000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000080900616"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,4]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1980,4]]}},"alternative-id":["0022000080900616"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(80)90061-6","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1980,4]]}}}