{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T07:29:42Z","timestamp":1648711782875},"reference-count":0,"publisher":"Oxford University Press (OUP)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Logic and Computation"],"published-print":{"date-parts":[[2010,2,1]]},"DOI":"10.1093\/logcom\/exp051","type":"journal-article","created":{"date-parts":[[2010,2,1]],"date-time":"2010-02-01T08:52:51Z","timestamp":1265014371000},"page":"381-387","source":"Crossref","is-referenced-by-count":1,"title":["A New Method to Obtain Termination in Backward Proof Search for Modal Logic S4"],"prefix":"10.1093","volume":"20","author":[{"given":"R.","family":"Pliuskevicius","sequence":"first","affiliation":[]},{"given":"A.","family":"Pliuskeviciene","sequence":"additional","affiliation":[]}],"member":"286","published-online":{"date-parts":[[2010,2,1]]},"container-title":["Journal of Logic and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/academic.oup.com\/logcom\/article-pdf\/20\/1\/381\/2803405\/exp051.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,23]],"date-time":"2017-08-23T07:12:23Z","timestamp":1503472343000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/logcom\/article-lookup\/doi\/10.1093\/logcom\/exp051"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,1]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2010,2,1]]},"published-print":{"date-parts":[[2010,2,1]]}},"URL":"https:\/\/doi.org\/10.1093\/logcom\/exp051","relation":{},"ISSN":["0955-792X","1465-363X"],"issn-type":[{"value":"0955-792X","type":"print"},{"value":"1465-363X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,1]]}}}