{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T21:03:27Z","timestamp":1776373407254,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642303524","type":"print"},{"value":"9783642303531","type":"electronic"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30353-1_36","type":"book-chapter","created":{"date-parts":[[2012,5,25]],"date-time":"2012-05-25T09:44:29Z","timestamp":1337939069000},"page":"356-361","source":"Crossref","is-referenced-by-count":47,"title":["Dsharp: Fast d-DNNF Compilation with sharpSAT"],"prefix":"10.1007","author":[{"given":"Christian","family":"Muise","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheila A.","family":"McIlraith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Christopher","family":"Beck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric I.","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"36_CR1","unstructured":"Beame, P., Kautz, H., Sabharwal, A.: Understanding the power of clause learning. In: International Joint Conference on Artificial Intelligence, vol.\u00a018, pp. 1194\u20131201 (2003)"},{"key":"36_CR2","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1016\/j.ijar.2005.10.001","volume":"42","author":"M. Chavira","year":"2006","unstructured":"Chavira, M., Darwiche, A., Jaeger, M.: Compiling relational bayesian networks for exact inference. International Journal of Approximate Reasoning\u00a042, 4\u201320 (2006)","journal-title":"International Journal of Approximate Reasoning"},{"key":"36_CR3","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1613\/jair.989","volume":"17","author":"A. Darwiche","year":"2002","unstructured":"Darwiche, A., Marquis, P.: A knowledge compilation map. Journal of Artificial Intelligence Research\u00a017, 229\u2013264 (2002)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"36_CR4","unstructured":"Darwiche, A.: New advances in compiling CNF to decomposable negational normal form. In: Proceedings of European Conference on Artificial Intelligence (2004)"},{"key":"36_CR5","unstructured":"Huang, J., Darwiche, A.: DPLL with a trace: from SAT to knowledge compilation. In: International Joint Conference On Artificial Intelligence, pp. 156\u2013162 (2005)"},{"key":"36_CR6","doi-asserted-by":"crossref","unstructured":"Jha, A., Suciu, D.: Knowledge compilation meets database theory: compiling queries to decision diagrams. In: Proceedings of the 14th International Conference on Database Theory, pp. 162\u2013173. ACM (2011)","DOI":"10.1145\/1938551.1938574"},{"key":"36_CR7","unstructured":"Muise, C., McIlraith, S.A., Beck, J.C., Hsu, E.: Fast d-DNNF compilation with sharpSAT. In: Workshop on Abstraction, Reformulation, and Approximation, AAAI 2010 (2010)"},{"key":"36_CR8","unstructured":"Palacios, H., Bonet, B., Darwiche, A., Geffner, H.: Pruning conformant plans by counting models on compiled d-DNNF representations. In: Proceedings of the 15th International Conference on Automated Planning and Scheduling, pp. 141\u2013150 (2005)"},{"key":"36_CR9","unstructured":"Siddiqi, S., Huang, J.: Probabilistic sequential diagnosis by compilation. In: Tenth International Symposium on Artificial Intelligence and Mathematics (2008)"},{"key":"36_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/11814948_38","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"M. Thurley","year":"2006","unstructured":"Thurley, M.: sharpSAT \u2013 Counting Models with Advanced Component Caching and Implicit BCP. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol.\u00a04121, pp. 424\u2013429. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30353-1_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:52:16Z","timestamp":1558299136000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30353-1_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642303524","9783642303531"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30353-1_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}