{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:23:49Z","timestamp":1759638229306},"publisher-location":"Berlin, Heidelberg","reference-count":4,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642215803"},{"type":"electronic","value":"9783642215810"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21581-0_30","type":"book-chapter","created":{"date-parts":[[2011,6,10]],"date-time":"2011-06-10T09:30:19Z","timestamp":1307698219000},"page":"362-363","source":"Crossref","is-referenced-by-count":4,"title":["Model Counting Using the Inclusion-Exclusion Principle"],"prefix":"10.1007","author":[{"given":"Huxley","family":"Bennett","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sriram","family":"Sankaranarayanan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","doi-asserted-by":"crossref","unstructured":"Bennett, H., Sankaranarayanan, S.: Model counting using the inclusion-exclusion principle, Draft (available upon request) (2011)","DOI":"10.1007\/978-3-642-21581-0_30"},{"key":"30_CR2","volume-title":"Handbook of Satisfiability, ch. 20","author":"C.P. Gomes","year":"2008","unstructured":"Gomes, C.P., Sabharwal, A., Selman, B.: Model counting. In: Handbook of Satisfiability, ch. 20. IOS Press, Amsterdam (2008)"},{"issue":"2","key":"30_CR3","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1137\/0218026","volume":"18","author":"K. Iwama","year":"1989","unstructured":"Iwama, K.: CNF-satisfiability test by counting and polynomial average time. SIAM Journal on Computing\u00a018(2), 385\u2013391 (1989)","journal-title":"SIAM Journal on Computing"},{"key":"30_CR4","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/0020-0190(92)90160-W","volume":"41","author":"E.L. Lozinskii","year":"1992","unstructured":"Lozinskii, E.L.: Counting propositional models. Information Processing Letters\u00a041, 327\u2013332 (1992)","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing - SAT 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21581-0_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T12:20:41Z","timestamp":1560255641000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21581-0_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642215803","9783642215810"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21581-0_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}