{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,23]],"date-time":"2026-09-23T09:46:45Z","timestamp":1790156805725,"version":"4.0.1"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319243177","type":"print"},{"value":"9783319243184","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-24318-4_15","type":"book-chapter","created":{"date-parts":[[2015,9,11]],"date-time":"2015-09-11T01:42:56Z","timestamp":1441935776000},"page":"199-214","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["On Compiling CNFs into Structured Deterministic DNNFs"],"prefix":"10.1007","author":[{"given":"Simone","family":"Bova","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Florent","family":"Capelli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Mengel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Friedrich","family":"Slivovsky","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,10,27]]},"reference":[{"key":"15_CR1","unstructured":"Bova, S., Capelli, F., Mengel, S., Slivovsky, F.: Expander CNFs have exponential DNNF size. CoRR, abs\/1411.1995 (2014)"},{"key":"15_CR2","unstructured":"Brault-Baron, J., Capelli, F., Mengel, S.: Understanding model counting for beta-acyclic CNF-formulas. In: Mayr, E.W., Ollinger, N. (eds.) 32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015. LIPIcs, vol. 30, pp. 143\u2013156. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015)"},{"key":"15_CR3","unstructured":"Chen, H.: Parameterized compilability. In: Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, IJCAI 2005, Edinburgh, Scotland, UK, July 30-August 5, 2005, pp. 412\u2013417 (2005)"},{"issue":"4","key":"15_CR4","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1145\/502090.502091","volume":"48","author":"A Darwiche","year":"2001","unstructured":"Darwiche, A.: Decomposable negation normal form. J. ACM 48(4), 608\u2013647 (2001)","journal-title":"J. ACM"},{"issue":"1\u20132","key":"15_CR5","doi-asserted-by":"publisher","first-page":"11","DOI":"10.3166\/jancl.11.11-34","volume":"11","author":"A Darwiche","year":"2001","unstructured":"Darwiche, A.: On the tractable counting of theory models and its application to truth maintenance and belief revision. Journal of Applied Non-Classical Logics 11(1\u20132), 11\u201334 (2001)","journal-title":"Journal of Applied Non-Classical Logics"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1613\/jair.989","volume":"17","author":"A Darwiche","year":"2002","unstructured":"Darwiche, A., Marquis, P.: A Knowledge Compilation Map. J. Artif. Intell. Res. (JAIR) 17, 229\u2013264 (2002)","journal-title":"J. Artif. Intell. Res. (JAIR)"},{"key":"15_CR7","volume-title":"Parameterized Complexity Theory","author":"J Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer-Verlag, New York (2006)"},{"issue":"3","key":"15_CR8","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1093\/comjnl\/bxm052","volume":"51","author":"P Hlinen\u00fd","year":"2008","unstructured":"Hlinen\u00fd, P., Oum, S., Seese, D., Gottlob, G.: Width parameters beyond tree-width and their applications. Comput. J. 51(3), 326\u2013362 (2008)","journal-title":"Comput. J."},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Karp, R.M., Lipton, R.J.: Some connections between nonuniform and uniform complexity classes. In: Proceedings of STOC 1980, pp. 302\u2013309. ACM (1980)","DOI":"10.1145\/800141.804678"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.tcs.2012.12.039","volume":"481","author":"S Ordyniak","year":"2013","unstructured":"Ordyniak, S., Paulusma, D., Szeider, S.: Satisfiability of acyclic and almost acyclic CNF formulas. Theoretical Computer Science 481, 85\u201399 (2013)","journal-title":"Theoretical Computer Science"},{"key":"15_CR11","unstructured":"Oztok, U., Darwiche, A.: CV-width: a new complexity parameter for CNFs. In: 21st European Conference on Artificial Intelligence, ECAI 2014, pp. 675\u2013680 (2014)"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-319-10428-7_7","volume-title":"Principles and Practice of Constraint Programming","author":"U Oztok","year":"2014","unstructured":"Oztok, U., Darwiche, A.: On compiling CNF into decision-DNNF. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 42\u201357. Springer, Heidelberg (2014)"},{"key":"15_CR13","unstructured":"Pipatsrisawat, K., Darwiche, A.: New compilation languages based on structured decomposability. In: Proceedings of the 23rd National Conference on Artificial Intelligence, AAAI 2008, vol. 1, pp. 517\u2013522. AAAI Press (2008)"},{"key":"15_CR14","unstructured":"Pipatsrisawat, K., Darwiche, A.: Top-down algorithms for constructing structured DNNF: theoretical and practical implications. In: Proceedings of 19th European Conference on Artificial Intelligence, ECAI 2010, Lisbon, Portugal, August 16\u201320, 2010. Frontiers in Artificial Intelligence and Applications, vol. 215, pp. 3\u20138. IOS Press (2010)"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/978-3-642-39071-5_25","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2013","author":"I Razgon","year":"2013","unstructured":"Razgon, I., Petke, J.: Cliquewidth and knowledge compilation. In: J\u00e4rvisalo, M., Van Gelder, A. (eds.) SAT 2013. LNCS, vol. 7962, pp. 335\u2013350. Springer, Heidelberg (2013)"},{"key":"15_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-319-09284-3_3","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2014","author":"SH S\u00e6ther","year":"2014","unstructured":"S\u00e6ther, S.H., Telle, J.A., Vatshelle, M.: Solving MaxSAT and #SAT on structured CNF formulas. In: Sinz, C., Egly, U. (eds.) SAT 2014. LNCS, vol. 8561, pp. 16\u201331. Springer, Heidelberg (2014)"},{"key":"15_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/978-3-642-45030-3_63","volume-title":"Algorithms and Computation","author":"F Slivovsky","year":"2013","unstructured":"Slivovsky, F., Szeider, S.: Model counting for formulas of bounded Clique-Width. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) Algorithms and Computation. LNCS, vol. 8283, pp. 677\u2013687. Springer, Heidelberg (2013)"},{"key":"15_CR18","unstructured":"Vatshelle, M.: New Width Parameters of Graphs. PhD thesis, University of Bergen (2012)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing -- SAT 2015"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-24318-4_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,25]],"date-time":"2026-06-25T05:07:13Z","timestamp":1782364033000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-24318-4_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319243177","9783319243184"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24318-4_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"27 October 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}