{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,2,14]],"date-time":"2023-02-14T07:32:47Z","timestamp":1676359967326},"reference-count":5,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1990,7,1]],"date-time":"1990-07-01T00:00:00Z","timestamp":646790400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,19]],"date-time":"2013-07-19T00:00:00Z","timestamp":1374192000000},"content-version":"vor","delay-in-days":8419,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["The Journal of Logic Programming"],"published-print":{"date-parts":[[1990,7]]},"DOI":"10.1016\/0743-1066(90)90031-y","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:32Z","timestamp":1027655252000},"page":"19-31","source":"Crossref","is-referenced-by-count":6,"title":["Minimal consequence in sentential logic"],"prefix":"10.1016","volume":"9","author":[{"given":"Mary-Angela","family":"Papalaskari","sequence":"first","affiliation":[]},{"given":"Scott","family":"Weinstein","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0743-1066(90)90031-Y_BIB1","series-title":"Model Theory","author":"Chang","year":"1973"},{"key":"10.1016\/0743-1066(90)90031-Y_BIB2","doi-asserted-by":"crossref","DOI":"10.1016\/0004-3702(80)90013-2","article-title":"The Mathematics of Non-monotonic Reasoning","volume":"13","author":"Davis","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/0743-1066(90)90031-Y_BIB3","series-title":"Recursion-Theoretic Hierarchies","author":"Hinman","year":"1978"},{"key":"10.1016\/0743-1066(90)90031-Y_BIB4","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0168-0072(87)90062-5","article-title":"Decidability and Definability with Circumscription","volume":"35","author":"Schlipf","year":"1987","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1","key":"10.1016\/0743-1066(90)90031-Y_BIB5","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2307\/2273858","article-title":"Classifying the Computational Complexity of Problems","volume":"52","author":"Stockmeyer","year":"1987","journal-title":"J. Symbolic Logic"}],"container-title":["The Journal of Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074310669090031Y?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074310669090031Y?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:55:53Z","timestamp":1555127753000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074310669090031Y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,7]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1990,7]]}},"alternative-id":["074310669090031Y"],"URL":"https:\/\/doi.org\/10.1016\/0743-1066(90)90031-y","relation":{},"ISSN":["0743-1066"],"issn-type":[{"value":"0743-1066","type":"print"}],"subject":[],"published":{"date-parts":[[1990,7]]}}}