{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:54:47Z","timestamp":1725796487768},"publisher-location":"Cham","reference-count":0,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319085869"},{"type":"electronic","value":"9783319085876"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08587-6_32","type":"book-chapter","created":{"date-parts":[[2014,7,2]],"date-time":"2014-07-02T03:38:32Z","timestamp":1404272312000},"page":"403-417","source":"Crossref","is-referenced-by-count":1,"title":["The Complexity of Theorem Proving in Circumscription and Minimal Entailment"],"prefix":"10.1007","author":[{"given":"Olaf","family":"Beyersdorff","sequence":"first","affiliation":[]},{"given":"Leroy","family":"Chew","sequence":"additional","affiliation":[]}],"member":"297","container-title":["Lecture Notes in Computer Science","Automated Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08587-6_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2014,7,2]],"date-time":"2014-07-02T03:39:00Z","timestamp":1404272340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-08587-6_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319085869","9783319085876"],"references-count":0,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08587-6_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}