{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T13:01:16Z","timestamp":1760014876028,"version":"3.40.3"},"publisher-location":"Cham","reference-count":69,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030584740"},{"type":"electronic","value":"9783030584757"}],"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"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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-58475-7_13","type":"book-chapter","created":{"date-parts":[[2020,9,6]],"date-time":"2020-09-06T20:02:35Z","timestamp":1599422555000},"page":"211-230","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["DPMC: Weighted Model Counting by Dynamic Programming on Project-Join Trees"],"prefix":"10.1007","author":[{"given":"Jeffrey M.","family":"Dudek","sequence":"first","affiliation":[]},{"given":"Vu H. N.","family":"Phan","sequence":"additional","affiliation":[]},{"given":"Moshe Y.","family":"Vardi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"key":"13_CR1","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":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-45578-7_9","volume-title":"Principles and Practice of Constraint Programming \u2014 CP 2001","author":"ASM Aguirre","year":"2001","unstructured":"Aguirre, A.S.M., Vardi, M.Y.: Random 3-SAT and BDDs: the plot thickens further. In: Walsh, T. (ed.) CP 2001. LNCS, vol. 2239, pp. 121\u2013136. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45578-7_9"},{"issue":"7","key":"13_CR3","doi-asserted-by":"publisher","first-page":"3089","DOI":"10.1137\/080739379","volume":"39","author":"I Arad","year":"2010","unstructured":"Arad, I., Landau, Z.: Quantum computation and the evaluation of tensor networks. SICOMP 39(7), 3089\u20133121 (2010). https:\/\/doi.org\/10.1137\/080739379","journal-title":"SICOMP"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1613\/jair.2648","volume":"34","author":"F Bacchus","year":"2009","unstructured":"Bacchus, F., Dalmao, S., Pitassi, T.: Solving #SAT and Bayesian inference with backtracking search. JAIR 34, 391\u2013442 (2009). https:\/\/doi.org\/10.1613\/jair.2648","journal-title":"JAIR"},{"issue":"2\u20133","key":"13_CR5","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1023\/A:1008699807402","volume":"10","author":"RI Bahar","year":"1997","unstructured":"Bahar, R.I., et al.: Algebraic decision diagrams and their applications. Formal Method Syst. Des. 10(2\u20133), 171\u2013206 (1997). https:\/\/doi.org\/10.1023\/A:1008699807402","journal-title":"Formal Method Syst. Des."},{"issue":"2","key":"13_CR6","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1109\/JPROC.2004.840311","volume":"93","author":"G Baumgartner","year":"2005","unstructured":"Baumgartner, G., et al.: Synthesis of high-performance parallel programs for a class of ab initio quantum chemistry models. IEEE 93(2), 276\u2013292 (2005). https:\/\/doi.org\/10.1109\/JPROC.2004.840311","journal-title":"IEEE"},{"issue":"3731","key":"13_CR7","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1126\/science.153.3731.34","volume":"153","author":"R Bellman","year":"1966","unstructured":"Bellman, R.: Dynamic programming. Science 153(3731), 34\u201337 (1966). https:\/\/doi.org\/10.1126\/science.153.3731.34","journal-title":"Science"},{"key":"13_CR8","unstructured":"Bouquet, F.: Gestion de la dynamicit\u00e9 et \u00e9num\u00e9ration d\u2019impliquants premiers: une approche fond\u00e9e sur les Diagrammes de D\u00e9cision Binaire. Ph.D. thesis, Aix-Marseille 1 (1999), https:\/\/www.theses.fr\/1999AIX11011"},{"key":"13_CR9","unstructured":"Burch, J.R., Clarke, E.M., Long, D.E.: Symbolic model checking with partitioned transition relations. In: VLSI, pp. 49\u201358 (1991). http:\/\/citeseerx.ist.psu.edu\/viewdoc\/summary?doi=10.1.1.23.1932"},{"key":"13_CR10","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":"13_CR11","unstructured":"Charwat, G., Woltran, S.: BDD-based dynamic programming on tree decompositions. Technical report, Technische Universit\u00e4t Wien, Institut f\u00fcr Informationssysteme (2016)"},{"key":"13_CR12","unstructured":"Chavira, M., Darwiche, A.: Compiling Bayesian networks using variable elimination. In: IJCAI, pp. 2443\u20132449 (2007). https:\/\/dl.acm.org\/doi\/10.5555\/1625275.1625669"},{"key":"13_CR13","unstructured":"Cichocki, A.: Era of big data processing: a new approach via tensor networks and tensor decompositions. arXiv preprint arXiv:1403.2048 (2014)"},{"issue":"2","key":"13_CR14","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1109\/MSP.2013.2297439","volume":"32","author":"A Cichocki","year":"2015","unstructured":"Cichocki, A., et al.: Tensor decompositions for signal processing applications: from two-way to multiway component analysis. IEEE SPM 32(2), 145\u2013163 (2015). https:\/\/doi.org\/10.1109\/MSP.2013.2297439","journal-title":"IEEE SPM"},{"issue":"1","key":"13_CR15","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1011276507260","volume":"19","author":"E Clarke","year":"2001","unstructured":"Clarke, E., Biere, A., Raimi, R., Zhu, Y.: Bounded model checking using satisfiability solving. Formal Method Syst. Des. 19(1), 7\u201334 (2001). https:\/\/doi.org\/10.1023\/A:1011276507260","journal-title":"Formal Method Syst. Des."},{"key":"13_CR16","unstructured":"Dal, G.H., Laarman, A.W., Lucas, P.J.: Parallel probabilistic inference by weighted model counting. In: PGM, pp. 97\u2013108 (2018). http:\/\/proceedings.mlr.press\/v72\/dal18a.html"},{"key":"13_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/3-540-46135-3_21","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"V Dalmau","year":"2002","unstructured":"Dalmau, V., Kolaitis, P.G., Vardi, M.Y.: Constraint satisfaction, bounded treewidth, and finite-variable logics. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 310\u2013326. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46135-3_21"},{"key":"13_CR18","unstructured":"Darwiche, A.: Dynamic jointrees. In: UAI, pp. 97\u2013104 (1998). https:\/\/dl.acm.org\/doi\/10.5555\/2074094.2074106"},{"key":"13_CR19","unstructured":"Darwiche, A.: New advances in compiling CNF to decomposable negation normal form. In: ECAI, pp. 318\u2013322 (2004). https:\/\/dl.acm.org\/doi\/10.5555\/3000001.3000069"},{"issue":"1\u20132","key":"13_CR20","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0004-3702(99)00059-4","volume":"113","author":"R Dechter","year":"1999","unstructured":"Dechter, R.: Bucket elimination: a unifying framework for reasoning. AIJ 113(1\u20132), 41\u201385 (1999). https:\/\/doi.org\/10.1016\/S0004-3702(99)00059-4","journal-title":"AIJ"},{"key":"13_CR21","doi-asserted-by":"publisher","unstructured":"Dechter, R.: Constraint Processing. Morgan Kaufmann (2003). https:\/\/doi.org\/10.1016\/B978-1-55860-890-0.X5000-2","DOI":"10.1016\/B978-1-55860-890-0.X5000-2"},{"issue":"3","key":"13_CR22","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/0004-3702(89)90037-4","volume":"38","author":"R Dechter","year":"1989","unstructured":"Dechter, R., Pearl, J.: Tree clustering for constraint networks. AIJ 38(3), 353\u2013366 (1989). https:\/\/doi.org\/10.1016\/0004-3702(89)90037-4","journal-title":"AIJ"},{"key":"13_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1007\/978-3-662-46681-0_60","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"T van Dijk","year":"2015","unstructured":"van Dijk, T., van de Pol, J.: Sylvan: multi-core decision diagrams. In: Baier, C., Tinelli, C. (eds.) TACAS 2015. LNCS, vol. 9035, pp. 677\u2013691. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-46681-0_60"},{"key":"13_CR24","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. JAIR 30, 565\u2013620 (2007). https:\/\/dl.acm.org\/doi\/10.5555\/1622637.1622652","journal-title":"JAIR"},{"key":"13_CR25","unstructured":"Dudek, J.M., Due\u00f1as-Osorio, L., Vardi, M.Y.: Efficient contraction of large tensor networks for weighted model counting through graph decompositions. arXiv preprint arXiv:1908.04381 (2019)"},{"key":"13_CR26","doi-asserted-by":"publisher","unstructured":"Dudek, J.M., Phan, V.H., Vardi, M.Y.: ADDMC: weighted model counting with algebraic decision diagrams. In: AAAI, vol. 34, pp. 1468\u20131476 (2020). https:\/\/doi.org\/10.1609\/aaai.v34i02.5505","DOI":"10.1609\/aaai.v34i02.5505"},{"key":"13_CR27","unstructured":"Dudek, J.M., Vardi, M.Y.: Parallel weighted model counting with tensor networks. In: MCW (2020). https:\/\/mccompetition.org\/assets\/files\/2020\/MCW_2020_paper_1.pdf"},{"issue":"24","key":"13_CR28","doi-asserted-by":"publisher","first-page":"245118","DOI":"10.1103\/PhysRevB.89.245118","volume":"89","author":"G Evenbly","year":"2014","unstructured":"Evenbly, G., Pfeifer, R.N.: Improving the efficiency of variational tensor network algorithms. Phys. Rev. B 89(24), 245118 (2014). https:\/\/doi.org\/10.1103\/PhysRevB.89.245118","journal-title":"Phys. Rev. B"},{"key":"13_CR29","unstructured":"Fargier, H., Marquis, P., Niveau, A., Schmidt, N.: A knowledge compilation map for ordered real-valued decision diagrams. In: AAAI (2014). https:\/\/dl.acm.org\/doi\/10.5555\/2893873.2894036"},{"key":"13_CR30","doi-asserted-by":"publisher","unstructured":"Fatahalian, K., Sugerman, J., Hanrahan, P.: Understanding the efficiency of GPU algorithms for matrix-matrix multiplication. In: SIGGRAPH\/EUROGRAPHICS, pp. 133\u2013137 (2004). https:\/\/doi.org\/10.1145\/1058129.1058148","DOI":"10.1145\/1058129.1058148"},{"key":"13_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-030-39197-3_10","volume-title":"Practical Aspects of Declarative Languages","author":"JK Fichte","year":"2020","unstructured":"Fichte, J.K., Hecher, M., Thier, P., Woltran, S.: Exploiting database management systems and treewidth for counting. In: Komendantskaya, E., Liu, Y. (eds.) PADL 2020. LNCS, vol. 12007, pp. 151\u2013167. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-39197-3_10"},{"key":"13_CR32","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":"13_CR33","unstructured":"Gogate, V., Domingos, P.: Approximation by Quantization. In: UAI, pp. 247\u2013255 (2011). https:\/\/dl.acm.org\/doi\/10.5555\/3020548.3020578"},{"key":"13_CR34","doi-asserted-by":"publisher","unstructured":"Gomes, C.P., Sabharwal, A., Selman, B.: Model counting. In: Handbook of Satisfiability (2009). https:\/\/doi.org\/10.3233\/978-1-58603-929-5-633. (Chap. 20)","DOI":"10.3233\/978-1-58603-929-5-633"},{"key":"13_CR35","unstructured":"Hoey, J., St-Aubin, R., Hu, A., Boutilier, C.: SPUDD: stochastic planning using decision diagrams. In: UAI, pp. 279\u2013288 (1999). https:\/\/arxiv.org\/abs\/1301.6704"},{"key":"13_CR36","doi-asserted-by":"publisher","unstructured":"J\u00e9gou, P., Kanso, H., Terrioux, C.: Improving exact solution counting for decomposition methods. In: ICTAI, pp. 327\u2013334. IEEE (2016). https:\/\/doi.org\/10.1109\/ICTAI.2016.0057","DOI":"10.1109\/ICTAI.2016.0057"},{"issue":"1\u20132","key":"13_CR37","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.artint.2005.04.004","volume":"166","author":"K Kask","year":"2005","unstructured":"Kask, K., Dechter, R., Larrosa, J., Dechter, A.: Unifying tree decompositions for reasoning in graphical models. AIJ 166(1\u20132), 165\u2013193 (2005). https:\/\/doi.org\/10.1016\/j.artint.2005.04.004","journal-title":"AIJ"},{"issue":"OOPSLA","key":"13_CR38","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3133901","volume":"1","author":"F Kjolstad","year":"2017","unstructured":"Kjolstad, F., Kamil, S., Chou, S., Lugato, D., Amarasinghe, S.: The tensor algebra compiler. PACMPL 1(OOPSLA), 1\u201329 (2017). https:\/\/doi.org\/10.1145\/3133901","journal-title":"PACMPL"},{"key":"13_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-40196-1_16","volume-title":"Quantitative Evaluation of Systems","author":"V Klebanov","year":"2013","unstructured":"Klebanov, V., Manthey, N., Muise, C.: SAT-based analysis and quantification of information flow in programs. In: Joshi, K., Siegle, M., Stoelinga, M., D\u2019Argenio, P.R. (eds.) QEST 2013. LNCS, vol. 8054, pp. 177\u2013192. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40196-1_16"},{"issue":"2","key":"13_CR40","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1006\/jcss.2000.1713","volume":"61","author":"PG Kolaitis","year":"2000","unstructured":"Kolaitis, P.G., Vardi, M.Y.: Conjunctive-query containment and constraint satisfaction. JCSS 61(2), 302\u2013332 (2000). https:\/\/doi.org\/10.1006\/jcss.2000.1713","journal-title":"JCSS"},{"key":"13_CR41","unstructured":"Koriche, F., Lagniez, J.M., Marquis, P., Thomas, S.: Knowledge compilation for model counting: affine decision trees. In: IJCAI (2013). https:\/\/dl.acm.org\/doi\/10.5555\/2540128.2540265"},{"key":"13_CR42","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/S1571-0653(05)80078-2","volume":"8","author":"AM Koster","year":"2001","unstructured":"Koster, A.M., Bodlaender, H.L., Van Hoesel, S.P.: Treewidth: computational experiments. Electron Notes Discrete Math. 8, 54\u201357 (2001). https:\/\/doi.org\/10.1016\/S1571-0653(05)80078-2","journal-title":"Electron Notes Discrete Math."},{"key":"13_CR43","doi-asserted-by":"publisher","unstructured":"Kourtis, S., Chamon, C., Mucciolo, E., Ruckenstein, A.: Fast counting with tensor networks. SciPost Phys. 7(5) (2019). https:\/\/doi.org\/10.21468\/SciPostPhys.7.5.060","DOI":"10.21468\/SciPostPhys.7.5.060"},{"key":"13_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-540-72522-0_6","volume-title":"Formal Methods for Performance Evaluation","author":"M Kwiatkowska","year":"2007","unstructured":"Kwiatkowska, M., Norman, G., Parker, D.: Stochastic model checking. In: Bernardo, M., Hillston, J. (eds.) SFM 2007. LNCS, vol. 4486, pp. 220\u2013270. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72522-0_6"},{"key":"13_CR45","unstructured":"Lagniez, J.M., Marquis, P.: Preprocessing for propositional model counting. In: AAAI (2014). https:\/\/dl.acm.org\/doi\/10.5555\/2892753.2892924"},{"key":"13_CR46","doi-asserted-by":"publisher","unstructured":"Lagniez, J.M., Marquis, P.: An improved decision-DNNF compiler. In: IJCAI, pp. 667\u2013673 (2017). https:\/\/doi.org\/10.24963\/ijcai.2017\/93","DOI":"10.24963\/ijcai.2017\/93"},{"issue":"3","key":"13_CR47","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1145\/355841.355847","volume":"5","author":"CL Lawson","year":"1979","unstructured":"Lawson, C.L., Hanson, R.J., Kincaid, D.R., Krogh, F.T.: Basic linear algebra subprograms for Fortran usage. TOMS 5(3), 308\u2013323 (1979). https:\/\/doi.org\/10.1145\/355841.355847","journal-title":"TOMS"},{"key":"13_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1007\/978-3-540-24741-8_26","volume-title":"Advances in Database Technology - EDBT 2004","author":"BJ McMahan","year":"2004","unstructured":"McMahan, B.J., Pan, G., Porter, P., Vardi, M.Y.: Projection pushing revisited. In: Bertino, E., et al. (eds.) EDBT 2004. LNCS, vol. 2992, pp. 441\u2013458. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24741-8_26"},{"key":"13_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/978-3-540-78163-9_24","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A Morgenstern","year":"2008","unstructured":"Morgenstern, A., Schneider, K.: From LTL to symbolically represented deterministic automata. In: Logozzo, F., Peled, D.A., Zuck, L.D. (eds.) VMCAI 2008. LNCS, vol. 4905, pp. 279\u2013293. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78163-9_24"},{"issue":"3","key":"13_CR50","first-page":"13","volume":"28","author":"Y Naveh","year":"2007","unstructured":"Naveh, Y., et al.: Constraint-based random stimuli generation for hardware verification. AI Mag. 28(3), 13\u201313 (2007). https:\/\/dl.acm.org\/doi\/10.5555\/1597122.1597129","journal-title":"AI Mag."},{"key":"13_CR51","unstructured":"Oliphant, T.E.: A guide to NumPy, vol. 1. Trelgol Publishing, USA (2006). https:\/\/dl.acm.org\/doi\/book\/10.5555\/2886196"},{"key":"13_CR52","unstructured":"Oztok, U., Darwiche, A.: A top-down compiler for sentential decision diagrams. In: IJCAI (2015). https:\/\/dl.acm.org\/doi\/10.5555\/2832581.2832687"},{"key":"13_CR53","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1613\/jair.2708","volume":"35","author":"H Palacios","year":"2009","unstructured":"Palacios, H., Geffner, H.: Compiling uncertainty away in conformant planning problems with bounded width. JAIR 35, 623\u2013675 (2009). https:\/\/dl.acm.org\/doi\/10.5555\/1641503.1641518","journal-title":"JAIR"},{"issue":"1\u20133","key":"13_CR54","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10817-005-9009-7","volume":"35","author":"G Pan","year":"2005","unstructured":"Pan, G., Vardi, M.Y.: Symbolic techniques in satisfiability solving. J. Autom. Reasoning 35(1\u20133), 25\u201350 (2005). https:\/\/doi.org\/10.1007\/s10817-005-9009-7","journal-title":"J. Autom. Reasoning"},{"issue":"2","key":"13_CR55","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1016\/0095-8956(91)90061-N","volume":"52","author":"N Robertson","year":"1991","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. X. Obstructions to tree-decomposition. J. Comb. Theory B 52(2), 153\u2013190 (1991). https:\/\/doi.org\/10.1016\/0095-8956(91)90061-N","journal-title":"J. Comb. Theory B"},{"issue":"1","key":"13_CR56","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-540-75560-9_35","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). https:\/\/doi.org\/10.1007\/978-3-540-75560-9_35","journal-title":"J. Discrete Algorithms"},{"issue":"2","key":"13_CR57","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.jcss.2009.04.003","volume":"76","author":"M Samer","year":"2010","unstructured":"Samer, M., Szeider, S.: Constraint satisfaction with bounded treewidth revisited. JCSS 76(2), 103\u2013114 (2010). https:\/\/doi.org\/10.1016\/j.jcss.2009.04.003","journal-title":"JCSS"},{"key":"13_CR58","first-page":"20","volume":"4","author":"T Sang","year":"2004","unstructured":"Sang, T., Bacchus, F., Beame, P., Kautz, H.A., Pitassi, T.: Combining component caching and clause learning for effective model counting. SAT 4, 20\u201328 (2004). http:\/\/www.satisfiability.org\/SAT04\/accepted\/65.html","journal-title":"SAT"},{"key":"13_CR59","unstructured":"Sang, T., Beame, P., Kautz, H.A.: Performing Bayesian inference by weighted model counting. In: AAAI, vol. 1, pp. 475\u2013482. AAAI Press (2005). https:\/\/dl.acm.org\/doi\/10.5555\/1619332.1619409"},{"key":"13_CR60","doi-asserted-by":"publisher","unstructured":"Shachter, R.D., Andersen, S.K., Szolovits, P.: Global conditioning for probabilistic inference in belief networks. In: UAI, pp. 514\u2013522. Elsevier (1994). https:\/\/doi.org\/10.1016\/B978-1-55860-332-5.50070-5","DOI":"10.1016\/B978-1-55860-332-5.50070-5"},{"issue":"1","key":"13_CR61","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1017\/S0890060403171065","volume":"17","author":"C Sinz","year":"2003","unstructured":"Sinz, C., Kaiser, A., K\u00fcchlin, W.: Formal methods for the validation of automotive product configuration data. AI EDAM 17(1), 75\u201397 (2003). https:\/\/doi.org\/10.1017\/S0890060403171065","journal-title":"AI EDAM"},{"key":"13_CR62","doi-asserted-by":"publisher","DOI":"10.1002\/0470012110","volume-title":"Multi-way Analysis: Applications in the Chemical Sciences","author":"A Smilde","year":"2005","unstructured":"Smilde, A., Bro, R., Geladi, P.: Multi-way Analysis: Applications in the Chemical Sciences. Wiley, Hoboken (2005). https:\/\/doi.org\/10.1002\/0470012110"},{"key":"13_CR63","unstructured":"Somenzi, F.: CUDD: CU decision diagram package-release 3.0.0. University of Colorado at Boulder (2015). https:\/\/github.com\/ivmai\/cudd"},{"key":"13_CR64","unstructured":"Strasser, B.: Computing tree decompositions with FlowCutter: PACE 2017 submission. arXiv preprint arXiv:1709.08949 (2017)"},{"key":"13_CR65","unstructured":"Tabajara, L.M., Vardi, M.Y.: Factored Boolean functional synthesis. In: FMCAD, pp. 124\u2013131. IEEE (2017). https:\/\/dl.acm.org\/doi\/10.5555\/3168451.3168480"},{"issue":"4","key":"13_CR66","doi-asserted-by":"publisher","first-page":"1283","DOI":"10.1007\/s10878-018-0353-z","volume":"37","author":"H Tamaki","year":"2019","unstructured":"Tamaki, H.: Positive-instance-driven dynamic programming for treewidth. J. Comb. Optim. 37(4), 1283\u20131311 (2019). https:\/\/doi.org\/10.1007\/s10878-018-0353-z","journal-title":"J. Comb. Optim."},{"issue":"3","key":"13_CR67","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1137\/0213035","volume":"13","author":"RE Tarjan","year":"1984","unstructured":"Tarjan, R.E., Yannakakis, M.: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SICOMP 13(3), 566\u2013579 (1984). https:\/\/doi.org\/10.1137\/0213035","journal-title":"SICOMP"},{"key":"13_CR68","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/BFb0016843","volume-title":"Constraints in Computational Logics","author":"TE Uribe","year":"1994","unstructured":"Uribe, T.E., Stickel, M.E.: Ordered binary decision diagrams and the Davis-Putnam procedure. In: Jouannaud, J.-P. (ed.) CCL 1994. LNCS, vol. 845, pp. 34\u201349. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/BFb0016843"},{"issue":"3","key":"13_CR69","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"LG Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SICOMP 8(3), 410\u2013421 (1979). https:\/\/doi.org\/10.1137\/0208032","journal-title":"SICOMP"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58475-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T05:31:00Z","timestamp":1619242260000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58475-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030584740","9783030584757"],"references-count":69,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58475-7_13","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":"2 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Constraint Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Louvain-la-Neuve","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","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":"7 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cp2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cp2020.a4cp.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"122","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":"55","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":"0","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":"45% - 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.13","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.47","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}