{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T04:40:02Z","timestamp":1746074402678,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642450297"},{"type":"electronic","value":"9783642450303"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-45030-3_63","type":"book-chapter","created":{"date-parts":[[2013,12,12]],"date-time":"2013-12-12T02:32:52Z","timestamp":1386815572000},"page":"677-687","source":"Crossref","is-referenced-by-count":9,"title":["Model Counting for Formulas of Bounded Clique-Width"],"prefix":"10.1007","author":[{"given":"Friedrich","family":"Slivovsky","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Szeider","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"63_CR1","doi-asserted-by":"crossref","unstructured":"Bacchus, F., Dalmao, S., Pitassi, T.: Algorithms and complexity results for #SAT and Bayesian inference. In: 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2003), pp. 340\u2013351 (2003)","DOI":"10.1109\/SFCS.2003.1238208"},{"issue":"7","key":"63_CR2","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1016\/j.dam.2009.09.009","volume":"158","author":"B.-M. Bui-Xuan","year":"2010","unstructured":"Bui-Xuan, B.-M., Telle, J.A., Vatshelle, M.: H-join decomposable graphs and algorithms with runtime single exponential in rankwidth. Discrete Applied Mathematics\u00a0158(7), 809\u2013819 (2010)","journal-title":"Discrete Applied Mathematics"},{"issue":"39","key":"63_CR3","doi-asserted-by":"publisher","first-page":"5187","DOI":"10.1016\/j.tcs.2011.05.022","volume":"412","author":"B.-M. Bui-Xuan","year":"2011","unstructured":"Bui-Xuan, B.-M., Telle, J.A., Vatshelle, M.: Boolean-width of graphs. Theoretical Computer Science\u00a0412(39), 5187\u20135204 (2011)","journal-title":"Theoretical Computer Science"},{"issue":"1-3","key":"63_CR4","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0012-365X(03)00303-0","volume":"276","author":"B. Courcelle","year":"2004","unstructured":"Courcelle, B.: Clique-width of countable graphs: a compactness property. Discrete Mathematics\u00a0276(1-3), 127\u2013148 (2004)","journal-title":"Discrete Mathematics"},{"issue":"3","key":"63_CR5","doi-asserted-by":"publisher","first-page":"1012","DOI":"10.1137\/070685920","volume":"38","author":"P. Hlin\u011bn\u00fd","year":"2008","unstructured":"Hlin\u011bn\u00fd, P., Oum, S.I.: Finding branch-decompositions and rank-decompositions. SIAM J. Comput.\u00a038(3), 1012\u20131032 (2008)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"63_CR6","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1016\/j.dam.2006.06.020","volume":"156","author":"E. Fischer","year":"2008","unstructured":"Fischer, E., Makowsky, J.A., Ravve, E.R.: Counting truth assignments of formulas of bounded tree-width or clique-width. Discr. Appl. Math.\u00a0156(4), 511\u2013529 (2008)","journal-title":"Discr. Appl. Math."},{"issue":"7","key":"63_CR7","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1016\/j.dam.2009.10.018","volume":"158","author":"R. Ganian","year":"2010","unstructured":"Ganian, R., Hlin\u011bn\u00fd, P.: On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width. Discr. Appl. Math.\u00a0158(7), 851\u2013867 (2010)","journal-title":"Discr. Appl. Math."},{"issue":"1","key":"63_CR8","doi-asserted-by":"crossref","first-page":"59","DOI":"10.3233\/FI-2013-800","volume":"123","author":"R. Ganian","year":"2013","unstructured":"Ganian, R., Hlin\u011bn\u00fd, P., Obdrz\u00e1lek, J.: Better algorithms for satisfiability problems for formulas of bounded rank-width. Fund. Inform.\u00a0123(1), 59\u201376 (2013)","journal-title":"Fund. Inform."},{"key":"63_CR9","unstructured":"Gaspers, S., Szeider, S.: Strong backdoors to bounded treewidth SAT. In: Proceedings of FOCS 2013, The 54th Annual Symposium on Foundations of Computer Science, Berkeley, California, USA (to appear, 2013)"},{"issue":"2","key":"63_CR10","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1137\/S0097539701396807","volume":"33","author":"G. Gottlob","year":"2004","unstructured":"Gottlob, G., Pichler, R.: Hypergraphs in model checking: acyclicity and hypertree-width versus clique-width. SIAM J. Comput.\u00a033(2), 351\u2013378 (2004)","journal-title":"SIAM J. Comput."},{"issue":"7-8","key":"63_CR11","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1007\/s00236-007-0056-x","volume":"44","author":"N. Nishimura","year":"2007","unstructured":"Nishimura, N., Ragde, P., Szeider, S.: Solving #SAT using vertex covers. Acta Informatica\u00a044(7-8), 509\u2013523 (2007)","journal-title":"Acta Informatica"},{"key":"63_CR12","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\u00a0481, 85\u201399 (2013)","journal-title":"Theoretical Computer Science"},{"key":"63_CR13","unstructured":"Paulusma, D., Slivovsky, F., Szeider, S.: Model counting for CNF formulas of bounded modular treewidth. In: Portier, N., Wilke, T. (eds.) Proceedings of STACS 2013. LIPIcs, vol.\u00a020, pp. 55\u201366. Leibniz-Zentrum fuer Informatik (2013)"},{"issue":"1-2","key":"63_CR14","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0004-3702(94)00092-1","volume":"82","author":"D. Roth","year":"1996","unstructured":"Roth, D.: On the hardness of approximate reasoning. Artificial Intelligence\u00a082(1-2), 273\u2013302 (1996)","journal-title":"Artificial Intelligence"},{"issue":"1","key":"63_CR15","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.jda.2009.06.002","volume":"8","author":"M. Samer","year":"2010","unstructured":"Samer, M., Szeider, S.: Algorithms for propositional model counting. J. Discrete Algorithms\u00a08(1), 50\u201364 (2010)","journal-title":"J. Discrete Algorithms"},{"key":"63_CR16","unstructured":"Sang, T., Beame, P., Kautz, H.A.: Performing Bayesian inference by weighted model counting. In: Proceedings of the 20th National Conference on Artificial Intelligence, AAAI 2005, vol.\u00a01, pp. 475\u2013481. AAAI Press (2005)"},{"key":"63_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-540-24605-3_15","volume-title":"Theory and Applications of Satisfiability Testing","author":"S. Szeider","year":"2004","unstructured":"Szeider, S.: On fixed-parameter tractable parameterizations of SAT. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 188\u2013202. Springer, Heidelberg (2004)"},{"issue":"2","key":"63_CR18","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/0304-3975(79)90044-6","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of computing the permanent. Theoretical Computer Science\u00a08(2), 189\u2013201 (1979)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-45030-3_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T04:24:47Z","timestamp":1746073487000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-45030-3_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642450297","9783642450303"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-45030-3_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}