{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:54:26Z","timestamp":1762102466389,"version":"3.40.3"},"publisher-location":"Cham","reference-count":44,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030391966"},{"type":"electronic","value":"9783030391973"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","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":[[2020]]},"DOI":"10.1007\/978-3-030-39197-3_10","type":"book-chapter","created":{"date-parts":[[2020,1,16]],"date-time":"2020-01-16T13:04:19Z","timestamp":1579179859000},"page":"151-167","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Exploiting Database Management Systems and Treewidth for Counting"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8681-7470","authenticated-orcid":false,"given":"Johannes K.","family":"Fichte","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0131-6771","authenticated-orcid":false,"given":"Markus","family":"Hecher","sequence":"additional","affiliation":[]},{"given":"Patrick","family":"Thier","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1594-8972","authenticated-orcid":false,"given":"Stefan","family":"Woltran","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,1,14]]},"reference":[{"key":"10_CR1","unstructured":"Postgresql documentation 12 (2019). https:\/\/www.postgresql.org\/docs\/12\/queries-with.html"},{"key":"10_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-319-59776-8_30","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"M Abseher","year":"2017","unstructured":"Abseher, M., Musliu, N., Woltran, S.: htd \u2013 a free, open-source framework for\u00a0(customized) tree decompositions and\u00a0beyond. In: Salvagnin, D., Lombardi, M. (eds.) CPAIOR 2017. LNCS, vol. 10335, pp. 376\u2013386. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59776-8_30"},{"key":"10_CR3","unstructured":"Bacchus, F., Dalmao, S., Pitassi, T.: Algorithms and complexity results for #SAT and Bayesian inference. In: FOCS 2003, pp. 340\u2013351. IEEE Computer Society (2003)"},{"issue":"8","key":"10_CR4","doi-asserted-by":"publisher","first-page":"172","DOI":"10.3390\/a12080172","volume":"12","author":"M Bannach","year":"2019","unstructured":"Bannach, M., Berndt, S.: Practical access to dynamic programming on tree decompositions. Algorithms 12(8), 172 (2019)","journal-title":"Algorithms"},{"issue":"1","key":"10_CR5","doi-asserted-by":"publisher","first-page":"27","DOI":"10.3233\/FI-2016-1397","volume":"147","author":"B Bliem","year":"2016","unstructured":"Bliem, B., Charwat, G., Hecher, M., Woltran, S.: D-flat$${}^{\\text{2 }}$$: subset minimization in dynamic programming on tree decompositions made easy. Fundam. Inform. 147(1), 27\u201361 (2016)","journal-title":"Fundam. Inform."},{"key":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-319-24318-4_5","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2015","author":"J Burchard","year":"2015","unstructured":"Burchard, J., Schubert, T., Becker, B.: Laissez-Faire caching for parallel #SAT solving. In: Heule, M., Weaver, S. (eds.) SAT 2015. LNCS, vol. 9340, pp. 46\u201361. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-24318-4_5"},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Chakraborty, S., Fremont, D.J., Meel, K.S., Seshia, S.A., Vardi, M.Y.: Distribution-aware sampling and weighted model counting for SAT. In: AAAI 2014, pp. 1722\u20131730. The AAAI Press (2014)","DOI":"10.1609\/aaai.v28i1.8990"},{"key":"10_CR8","unstructured":"Chakraborty, S., Meel, K.S., Vardi, M.Y.: Improving approximate counting for probabilistic inference: From linear to logarithmic sat solver calls. In: IJCAI 2016, pp. 3569\u20133576. The AAAI Press (2016)"},{"issue":"1\u20132","key":"10_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.3233\/FI-2019-1810","volume":"167","author":"G Charwat","year":"2019","unstructured":"Charwat, G., Woltran, S.: Expansion-based QBF solving on tree decompositions. Fundam. Inform. 167(1\u20132), 59\u201392 (2019)","journal-title":"Fundam. Inform."},{"key":"10_CR10","unstructured":"Choi, A., Van den Broeck, G., Darwiche, A.: Tractable learning for structured probability spaces: a case study in learning preference distributions. In: IJCAI 2015. The AAAI Press (2015)"},{"issue":"6","key":"10_CR11","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1145\/362384.362685","volume":"13","author":"EF Codd","year":"1970","unstructured":"Codd, E.F.: A relational model of data for large shared data banks. Commun. ACM 13(6), 377\u2013387 (1970)","journal-title":"Commun. ACM"},{"key":"10_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Switzerland (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"10_CR13","unstructured":"Darwiche, A.: New advances in compiling CNF to decomposable negation normal form. In: ECAI 2004, pp. 318\u2013322. IOS Press (2004)"},{"key":"10_CR14","unstructured":"Darwiche, A.: SDD: a new canonical representation of propositional knowledge bases. In: IJCAI 2011, pp. 819\u2013826. AAAI Press\/IJCAI (2011)"},{"key":"10_CR15","unstructured":"Dell, H., Komusiewicz, C., Talmon, N., Weller, M.: The PACE 2017 parameterized algorithms and computational experiments challenge: the second iteration. In: IPEC 2017, Leibniz International Proceedings in Informatics (LIPIcs), vol. 89, pp. 30:1\u201330:12. Dagstuhl Publishing (2018)"},{"key":"10_CR16","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53622-3","volume-title":"Graph Theory","author":"R Diestel","year":"2012","unstructured":"Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-662-53622-3","edition":"4"},{"key":"10_CR17","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1613\/jair.2289","volume":"30","author":"C Domshlak","year":"2007","unstructured":"Domshlak, C., Hoffmann, J.: Probabilistic planning via heuristic forward search and weighted model counting. J. Artif. Intell. Res. 30, 565\u2013620 (2007)","journal-title":"J. Artif. Intell. Res."},{"key":"10_CR18","unstructured":"Doubilet, P., Rota, G.C., Stanley, R.: On the foundations of combinatorial theory (VI): the idea of generating function. In: Berkeley Symposium on Mathematical Statistics and Probability, vol. 2, pp. 267\u2013318 (1972)"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Due\u00f1as-Osorio, L., Meel, K.S., Paredes, R., Vardi, M.Y.: Counting-based reliability estimation for power-transmission grids. In: AAAI 2017, pp. 4488\u20134494. The AAAI Press (2017)","DOI":"10.1609\/aaai.v31i1.11178"},{"key":"10_CR20","unstructured":"Ermon, S., Gomes, C.P., Selman, B.: Uniform solution sampling using a constraint solver as an oracle. In: UAI 2012, pp. 255\u2013264. AUAI Press (2012)"},{"key":"10_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-319-94144-8_11","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2018","author":"JK Fichte","year":"2018","unstructured":"Fichte, J.K., Hecher, M., Morak, M., Woltran, S.: Exploiting treewidth for projected model counting and its limits. In: Beyersdorff, O., Wintersteiger, C.M. (eds.) SAT 2018. LNCS, vol. 10929, pp. 165\u2013184. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94144-8_11"},{"key":"10_CR22","unstructured":"Fichte, J.K., Hecher, M., Woltran, S., Zisser, M.: A benchmark collection of #SAT instances and tree decompositions (benchmark set), June 2018. https:\/\/doi.org\/10.5281\/zenodo.1299752"},{"key":"10_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/978-3-030-30048-7_29","volume-title":"Principles and Practice of Constraint Programming","author":"JK Fichte","year":"2019","unstructured":"Fichte, J.K., Hecher, M., Zisser, M.: An improved GPU-based SAT model counter. In: Schiex, T., de Givry, S. (eds.) CP 2019. LNCS, vol. 11802, pp. 491\u2013509. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30048-7_29"},{"key":"10_CR24","unstructured":"Gomes, C.P., Sabharwal, A., Selman, B.: Chapter 20: Model counting. In: Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185, pp. 633\u2013654. IOS Press (2009)"},{"key":"10_CR25","unstructured":"Kiljan, K., Pilipczuk, M.: Experimental evaluation of parameterized algorithms for feedback vertex set. In: SEA. LIPIcs, vol. 103, pp. 12:1\u201312:12. Schloss Dagstuhl (2018)"},{"key":"10_CR26","volume-title":"Propositional Logic: Deduction and Algorithms","author":"H Kleine B\u00fcning","year":"1999","unstructured":"Kleine B\u00fcning, H., Lettman, T.: Propositional Logic: Deduction and Algorithms. Cambridge University Press, Cambridge (1999)"},{"key":"10_CR27","series-title":"LNCS","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth: Computations and Approximations","author":"T Kloks","year":"1994","unstructured":"Kloks, T.: Treewidth: Computations and Approximations. LNCS, vol. 842. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/BFb0045375"},{"key":"10_CR28","unstructured":"Koriche, F., Lagniez, J.M., Marquis, P., Thomas, S.: Knowledge compilation for model counting: affine decision trees. In: IJCAI 2013. The AAAI Press (2013)"},{"key":"10_CR29","doi-asserted-by":"crossref","unstructured":"Lagniez, J., Marquis, P.: Preprocessing for propositional model counting. In: AAAI, pp. 2688\u20132694. AAAI Press (2014)","DOI":"10.1609\/aaai.v28i1.9116"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Lagniez, J.M., Marquis, P.: An improved decision-DDNF compiler. In: IJCAI 2017, pp. 667\u2013673. The AAAI Press (2017)","DOI":"10.24963\/ijcai.2017\/93"},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"Langer, A., Reidl, F., Rossmanith, P., Sikdar, S.: Evaluation of an MSO-solver. In: Proceedings of ALENEX. pp. 55\u201363. SIAM\/Omnipress (2012)","DOI":"10.1137\/1.9781611972924.5"},{"issue":"2","key":"10_CR32","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1109\/TNN.2005.860887","volume":"17","author":"J Liu","year":"2006","unstructured":"Liu, J., Zhong, W., Jiao, L.: Comments on \u201cthe 1993 DIMACS graph coloring challenge\u201d and \u201cenergy function-based approaches to graph coloring\u201d. IEEE Trans. Neural Netw. 17(2), 533 (2006)","journal-title":"IEEE Trans. Neural Netw."},{"key":"10_CR33","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-642-30353-1_36","volume-title":"Advances in Artificial Intelligence","author":"C Muise","year":"2012","unstructured":"Muise, C., McIlraith, S.A., Beck, J.C., Hsu, E.I.: Dsharp: fast d-DNNF compilation with sharpSAT. In: Kosseim, L., Inkpen, D. (eds.) AI 2012. LNCS (LNAI), vol. 7310, pp. 356\u2013361. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30353-1_36"},{"key":"10_CR34","unstructured":"Oztok, U., Darwiche, A.: A top-down compiler for sentential decision diagrams. In: IJCAI 2015, pp. 3141\u20133148. The AAAI Press (2015)"},{"issue":"1\u20132","key":"10_CR35","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. Artif. Intell. 82(1\u20132), 273\u2013302 (1996)","journal-title":"Artif. Intell."},{"issue":"1","key":"10_CR36","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 8(1), 50\u201364 (2010)","journal-title":"J. Discrete Algorithms"},{"key":"10_CR37","unstructured":"Sang, T., Bacchus, F., Beame, P., Kautz, H., Pitassi, T.: Combining component caching and clause learning for effective model counting. In: SAT 2004 (2004)"},{"key":"10_CR38","unstructured":"Sang, T., Beame, P., Kautz, H.: Performing Bayesian inference by weighted model counting. In: AAAI 2005. The AAAI Press (2005)"},{"key":"10_CR39","doi-asserted-by":"crossref","unstructured":"Sharma, S., Roy, S., Soos, M., Meel, K.S.: GANAK: a scalable probabilistic exact model counter. In: IJCAI, pp. 1169\u20131176. ijcai.org (2019)","DOI":"10.24963\/ijcai.2019\/163"},{"key":"10_CR40","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. 4121, pp. 424\u2013429. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11814948_38"},{"issue":"5","key":"10_CR41","doi-asserted-by":"publisher","first-page":"865","DOI":"10.1137\/0220053","volume":"20","author":"S Toda","year":"1991","unstructured":"Toda, S.: PP is as hard as the polynomial-time hierarchy. SIAM J. Comput. 20(5), 865\u2013877 (1991)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"10_CR42","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2975585","volume":"21","author":"Takahisa Toda","year":"2016","unstructured":"Toda, T., Soh, T.: Implementing efficient all solutions SAT solvers. ACM J. Exp. Algorithmics 21, 1\u201312 (2015). special Issue SEA 2014","journal-title":"Journal of Experimental Algorithmics"},{"key":"10_CR43","unstructured":"Ullman, J.D.: Principles of Database and Knowledge-Base Systems, vol. II. Computer Science Press (1989)"},{"key":"10_CR44","unstructured":"Xue, Y., Choi, A., Darwiche, A.: Basing decisions on sentences in decision diagrams. In: AAAI 2012. The AAAI Press (2012)"}],"container-title":["Lecture Notes in Computer Science","Practical Aspects of Declarative Languages"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39197-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,11]],"date-time":"2022-10-11T17:38:34Z","timestamp":1665509914000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39197-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030391966","9783030391973"],"references-count":44,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39197-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 January 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PADL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Practical Aspects of Declarative Languages","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New Orleans, LA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 January 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 January 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"padl2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/popl20.sigplan.org\/home\/PADL-2020","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}