{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T16:39:41Z","timestamp":1743266381268,"version":"3.40.3"},"publisher-location":"Cham","reference-count":60,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030300470"},{"type":"electronic","value":"9783030300487"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-30048-7_5","type":"book-chapter","created":{"date-parts":[[2019,9,22]],"date-time":"2019-09-22T23:03:06Z","timestamp":1569193386000},"page":"71-90","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On Symbolic Approaches for Computing the Matrix Permanent"],"prefix":"10.1007","author":[{"given":"Supratik","family":"Chakraborty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aditya A.","family":"Shrotri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Moshe Y.","family":"Vardi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,23]]},"reference":[{"key":"5_CR1","unstructured":"Dudek, J.M., Phan, V.H.N., Vardi, M.Y.: ADDMC: Exact weighted model counting with algebraic decision diagrams. https:\/\/arxiv.org\/abs\/1907.05000"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11527695_1","volume-title":"Theory and Applications of Satisfiability Testing","author":"C Ans\u00f3tegui","year":"2005","unstructured":"Ans\u00f3tegui, C., Many\u00e0, F.: Mapping problems with finite-domain variables to problems with boolean variables. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 1\u201315. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11527695_1"},{"key":"5_CR3","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804090","volume-title":"Computational Complexity: A Modern Approach","author":"S Arora","year":"2009","unstructured":"Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge University Press, Cambridge (2009)"},{"issue":"2\/3","key":"5_CR4","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1023\/A:1008699807402","volume":"10","author":"R Bahar","year":"1997","unstructured":"Bahar, R., et al.: Algebraic decision diagrams and their applications. J. Formal Methods Syst. Des. 10(2\/3), 171\u2013206 (1997)","journal-title":"J. Formal Methods Syst. Des."},{"issue":"1","key":"5_CR5","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/s00453-001-0072-0","volume":"32","author":"E Bax","year":"2002","unstructured":"Bax, E., Franklin, J.: A permanent algorithm with exp [(n1\/3\/2ln (n))] expected speedup for 0\u20131 matrices. Algorithmica 32(1), 157\u2013162 (2002)","journal-title":"Algorithmica"},{"key":"5_CR6","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T.: Handbook of Satisfiability: Volume 185 Frontiers in Artificial Intelligence and Applications. IOS Press, Amsterdam (2009)"},{"key":"5_CR7","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. PhD thesis, Aix-Marseille 1 (1999)"},{"key":"5_CR8","unstructured":"Brault-Baron, J., Capelli, F., Mengel, S.: Understanding model counting for $$\\beta $$ -acyclic CNF-formulas. arXiv preprint arXiv:1405.6043 (2014)"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Broder, A.Z.: How hard is it to marry at random? (on the approximation of the permanent). In: Proceedings of the Eighteenth Annual ACM Symposium on Theory of Computing, pp. 50\u201358. ACM (1986)","DOI":"10.1145\/12130.12136"},{"key":"5_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":"5_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/3-540-49116-3_8","volume-title":"STACS 99","author":"J-Y Cai","year":"1999","unstructured":"Cai, J.-Y., Pavan, A., Sivakumar, D.: On the hardness of permanent. In: Meinel, C., Tison, S. (eds.) STACS 1999. LNCS, vol. 1563, pp. 90\u201399. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-49116-3_8"},{"issue":"2","key":"5_CR12","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/BF01164652","volume":"18","author":"GG Cash","year":"1995","unstructured":"Cash, G.G.: A fast computer algorithm for finding the permanent of adjacency matrices. J. Math. Chem. 18(2), 115\u2013119 (1995)","journal-title":"J. Math. Chem."},{"key":"5_CR13","first-page":"327","volume":"73","author":"Q Chou","year":"2015","unstructured":"Chou, Q., Liang, H., Bai, F.: Computing the permanental polynomial of the high level fullerene C70 with high precision. MATCH Commun. Math. Comput. Chem. 73, 327\u2013336 (2015)","journal-title":"MATCH Commun. Math. Comput. Chem."},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Courcelle, B.: Graph rewriting: an algebraic and logic approach. In: Formal Models and Semantics, pp. 193\u2013242. Elsevier (1990)","DOI":"10.1016\/B978-0-444-88074-1.50010-X"},{"issue":"2","key":"5_CR15","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/0022-0000(93)90004-G","volume":"46","author":"B Courcelle","year":"1993","unstructured":"Courcelle, B., Engelfriet, J., Rozenberg, G.: Handle-rewriting hypergraph grammars. J. Comput. Syst. Sci. 46(2), 218\u2013270 (1993)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1\u20132","key":"5_CR16","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0166-218X(00)00221-3","volume":"108","author":"B Courcelle","year":"2001","unstructured":"Courcelle, B., Makowsky, J.A., Rotics, U.: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic. Discrete Appl. Math. 108(1\u20132), 23\u201352 (2001)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"5_CR17","first-page":"1","volume":"38","author":"TA Davis","year":"2011","unstructured":"Davis, T.A., Hu, Y.: The university of florida sparse matrix collection. ACM Trans. Math. Softw. (TOMS) 38(1), 1 (2011)","journal-title":"ACM Trans. Math. Softw. (TOMS)"},{"issue":"1\u20132","key":"5_CR18","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. Artif. Intell. 113(1\u20132), 41\u201385 (1999)","journal-title":"Artif. Intell."},{"issue":"4","key":"5_CR19","first-page":"21","volume":"10","author":"H Dell","year":"2014","unstructured":"Dell, H., Husfeldt, T., Marx, D., Taslaman, N., Wahl\u00e9n, M.: Exponential time complexity of the permanent and the tutte polynomial. ACM Trans. Algorithms (TALG) 10(4), 21 (2014)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Duenas-Osorio, L., Meel, K.S., Paredes, R., Vardi, M.Y.: Counting-based reliability estimation for power-transmission grids. In: AAAI, pp. 4488\u20134494 (2017)","DOI":"10.1609\/aaai.v31i1.11178"},{"issue":"2\u20133","key":"5_CR21","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1023\/A:1008647823331","volume":"10","author":"M Fujita","year":"1997","unstructured":"Fujita, M., McGeer, P., Yang, J.-Y.: Multi-terminal binary decision diagrams: an efficient datastructure for matrix representation. Form. Methods Syst. Des. 10(2\u20133), 149\u2013169 (1997)","journal-title":"Form. Methods Syst. Des."},{"key":"5_CR22","unstructured":"Gent, I.P., Nightingale, P.: A new encoding of all different into SAT. In: International Workshop on Modelling and Reformulating Constraint Satisfaction, pp. 95\u2013110 (2004)"},{"issue":"3","key":"5_CR23","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1063\/1.1700437","volume":"20","author":"M Gordon","year":"1952","unstructured":"Gordon, M., Davison, W.: Theory of resonance topology of fully aromatic hydrocarbons. I. J. Chem. Phys. 20(3), 428\u2013435 (1952)","journal-title":"J. Chem. Phys."},{"key":"5_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/3-540-48168-0_3","volume-title":"Computer Science Logic","author":"M Grohe","year":"1999","unstructured":"Grohe, M.: Descriptive and parameterized complexity. In: Flum, J., Rodriguez-Artalejo, M. (eds.) CSL 1999. LNCS, vol. 1683, pp. 14\u201331. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48168-0_3"},{"issue":"4","key":"5_CR25","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n $$\\hat{}\\,5\/2$$ algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"5_CR26","doi-asserted-by":"publisher","first-page":"016706","DOI":"10.1103\/PhysRevE.77.016706","volume":"77","author":"Y Huo","year":"2008","unstructured":"Huo, Y., Liang, H., Liu, S.-Q., Bai, F.: Computing monomer-dimer systems through matrix permanent. Phys. Rev. E 77(1), 016706 (2008)","journal-title":"Phys. Rev. E"},{"key":"5_CR27","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/978-3-319-94144-8_26","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2018","author":"Alexey Ignatiev","year":"2018","unstructured":"Ignatiev, A., Morgado, A., Marques-Silva, J.: PySAT: a Python toolkit for prototyping with SAT oracles. In: SAT, pp. 428\u2013437 (2018)"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Izumi, T., Wadayama, T.: A new direction for counting perfect matchings. In: 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, pp. 591\u2013598. IEEE (2012)","DOI":"10.1109\/FOCS.2012.28"},{"issue":"12","key":"5_CR29","doi-asserted-by":"publisher","first-page":"1209","DOI":"10.1016\/0031-8914(61)90063-5","volume":"27","author":"PW Kasteleyn","year":"1961","unstructured":"Kasteleyn, P.W.: The statistics of dimers on a lattice: I. The number of dimer arrangements on a quadratic lattice. Physica 27(12), 1209\u20131225 (1961)","journal-title":"Physica"},{"key":"5_CR30","unstructured":"Knuth, D.E.: Generating all n-tuples. The Art of Computer Programming, 4 (2004)"},{"key":"5_CR31","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)","journal-title":"Electron. Notes Discrete Math."},{"issue":"6042","key":"5_CR32","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1038\/318162a0","volume":"318","author":"HW Kroto","year":"1985","unstructured":"Kroto, H.W., Heath, J.R., O\u2019Brien, S.C., Curl, R.F., Smalley, R.E.: C60: Buckminsterfullerene. Nature 318(6042), 162 (1985)","journal-title":"Nature"},{"key":"5_CR33","doi-asserted-by":"crossref","unstructured":"Lagniez, J.-M., Marquis, P.: An improved decision-DNNF compiler. In: IJCAI, pp. 667\u2013673 (2017)","DOI":"10.24963\/ijcai.2017\/93"},{"issue":"2","key":"5_CR34","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.cpc.2004.08.003","volume":"163","author":"H Liang","year":"2004","unstructured":"Liang, H., Bai, F.: A partially structure-preserving algorithm for the permanents of adjacency matrices of fullerenes. Comput. Phys. Commun. 163(2), 79\u201384 (2004)","journal-title":"Comput. Phys. Commun."},{"issue":"2","key":"5_CR35","first-page":"708","volume":"172","author":"H Liang","year":"2006","unstructured":"Liang, H., Huang, S., Bai, F.: A hybrid algorithm for computing permanents of sparse matrices. Appl. Math. Comput. 172(2), 708\u2013716 (2006)","journal-title":"Appl. Math. Comput."},{"key":"5_CR36","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-319-10428-7_39","volume-title":"International Conference on Principles and Practice of Constraint Programming","author":"R Martins","year":"2014","unstructured":"Martins, R., Joshi, S., Manquinho, V., Lynce, I.: Incremental cardinality constraints for MaxSAT. In: O\u2019Sullivan, B. (ed.) International Conference on Principles and Practice of Constraint Programming, pp. 531\u2013548. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10428-7_39"},{"key":"5_CR37","doi-asserted-by":"crossref","unstructured":"Muise, C., McIlraith, S.A., Beck, J.C., Hsu, E.: DSHARP: fast d-DNNF compilation with sharpSAT. In: Canadian Conference on Artificial Intelligence (2012)","DOI":"10.1007\/978-3-642-30353-1_36"},{"key":"5_CR38","unstructured":"Nijenhuis, A., Wilf, H.S.: Combinatorial Algorithms: for Computers and Calculators. Elsevier (2014)"},{"key":"5_CR39","doi-asserted-by":"crossref","unstructured":"Ogawa, T., Liu, Y., Hasegawa, R., Koshimura, M., Fujita, H.: Modulo based CNF encoding of cardinality constraints and its application to MaxSAT solvers. In: 2013 IEEE 25th International Conference on Tools with Artificial Intelligence, pp. 9\u201317. IEEE (2013)","DOI":"10.1109\/ICTAI.2013.13"},{"key":"5_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-642-11409-0_26","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"Y Okamoto","year":"2010","unstructured":"Okamoto, Y., Uehara, R., Uno, T.: Counting the number of matchings in chordal and chordal bipartite graph classes. In: Paul, C., Habib, M. (eds.) WG 2009. LNCS, vol. 5911, pp. 296\u2013307. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-11409-0_26"},{"key":"5_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/11527695_19","volume-title":"Theory and Applications of Satisfiability Testing","author":"G Pan","year":"2005","unstructured":"Pan, G., Vardi, M.Y.: Search vs. symbolic techniques in satisfiability solving. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 235\u2013250. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11527695_19"},{"key":"5_CR42","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1613\/jair.3463","volume":"43","author":"G Pesant","year":"2012","unstructured":"Pesant, G., Quimper, C.-G., Zanarini, A.: Counting-based search: Branching heuristics for constraint satisfaction problems. J. Artif. Intell. Res. 43, 173\u2013210 (2012)","journal-title":"J. Artif. Intell. Res."},{"key":"5_CR43","first-page":"362","volume":"94","author":"J-C R\u00e9gin","year":"1994","unstructured":"R\u00e9gin, J.-C.: A filtering algorithm for constraints of difference in CSPs. AAAI 94, 362\u2013367 (1994)","journal-title":"AAAI"},{"issue":"1","key":"5_CR44","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0095-8956(84)90013-3","volume":"36","author":"N Robertson","year":"1984","unstructured":"Robertson, N., Seymour, P.D.: Graph minors. III. Planar tree-width. J. Comb. Theory Ser. B 36(1), 49\u201364 (1984)","journal-title":"J. Comb. Theory Ser. B"},{"issue":"1","key":"5_CR45","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), 273\u2013302 (1996)","journal-title":"Artif. Intell."},{"key":"5_CR46","doi-asserted-by":"crossref","unstructured":"Ryser, H.: Combinatorial mathematics, the carus mathematical monographs. Mathematical Association of America, no. 4 (1963)","DOI":"10.5948\/UPO9781614440147"},{"key":"5_CR47","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1613\/jair.4831","volume":"54","author":"SH S\u00e6ther","year":"2015","unstructured":"S\u00e6ther, S.H., Telle, J.A., Vatshelle, M.: Solving #SAT and MaxSAT by dynamic programming. J. Artif. Intell. Res. 54, 59\u201382 (2015)","journal-title":"J. Artif. Intell. Res."},{"issue":"3","key":"5_CR48","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.ipl.2005.06.007","volume":"96","author":"RA Servedio","year":"2005","unstructured":"Servedio, R.A., Wan, A.: Computing sparse permanents faster. Inf. Process. Lett. 96(3), 89\u201392 (2005)","journal-title":"Inf. Process. Lett."},{"key":"5_CR49","doi-asserted-by":"publisher","first-page":"827","DOI":"10.1007\/11564751_73","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"Carsten Sinz","year":"2005","unstructured":"Sinz, C.: Towards an optimal CNF encoding of boolean cardinality constraints. In: van Beek, P. (eds) International Conference on Principles and Practice of Constraint Programming, pp. 827\u2013831. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11564751_73"},{"key":"5_CR50","unstructured":"Somenzi, F.: CUDD package, release 2.4.1. http:\/\/vlsi.colorado.edu\/~fabio\/CUDD\/"},{"issue":"3","key":"5_CR51","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. SIAM J. Comput. 13(3), 566\u2013579 (1984)","journal-title":"SIAM J. Comput."},{"issue":"68","key":"5_CR52","doi-asserted-by":"publisher","first-page":"1061","DOI":"10.1080\/14786436108243366","volume":"6","author":"HN Temperley","year":"1961","unstructured":"Temperley, H.N., Fisher, M.E.: Dimer problem in statistical mechanics-an exact result. Philos. Mag. 6(68), 1061\u20131063 (1961)","journal-title":"Philos. Mag."},{"key":"5_CR53","doi-asserted-by":"crossref","unstructured":"Toda, S.: On the computational power of PP and (+)P. In: Proceedings of FOCS, pp. 514\u2013519. IEEE (1989)","DOI":"10.1109\/SFCS.1989.63527"},{"issue":"3","key":"5_CR54","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L Valiant","year":"1979","unstructured":"Valiant, L.: The complexity of enumeration and reliability problems. SIAM J. Comput. 8(3), 410\u2013421 (1979)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"5_CR55","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/s10009-016-0433-2","volume":"19","author":"T Dijk van","year":"2017","unstructured":"van Dijk, T., van de Pol, J.: Sylvan: multi-core framework for decision diagrams. Int. J. Softw. Tools Technol. Transf. 19(6), 675\u2013696 (2017)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"5_CR56","unstructured":"Wallace, C., Korb, K.B., Dai, H.: Causal discovery via MML. In: ICML 1996, pp. 516\u2013524 (1996)"},{"issue":"6","key":"5_CR57","doi-asserted-by":"publisher","first-page":"1017","DOI":"10.1002\/nla.1844","volume":"19","author":"L Wang","year":"2012","unstructured":"Wang, L., Liang, H., Bai, F., Huo, Y.: A load balancing strategy for parallel computation of sparse permanents. Numer. Linear Algebra Appl. 19(6), 1017\u20131030 (2012)","journal-title":"Numer. Linear Algebra Appl."},{"issue":"9","key":"5_CR58","doi-asserted-by":"publisher","first-page":"092203","DOI":"10.1063\/1.3464263","volume":"51","author":"T-C Wei","year":"2010","unstructured":"Wei, T.-C., Severini, S.: Matrix permanent and quantum entanglement of permutation invariant states. J. Math. Phys. 51(9), 092203 (2010)","journal-title":"J. Math. Phys."},{"key":"5_CR59","first-page":"831","volume":"69","author":"B Yue","year":"2013","unstructured":"Yue, B., Liang, H., Bai, F.: Improved algorithms for permanent and permanental polynomial of sparse graph. MATCH Commun. Math. Comput. Chem. 69, 831\u2013842 (2013)","journal-title":"MATCH Commun. Math. Comput. Chem."},{"issue":"3","key":"5_CR60","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1007\/s10601-008-9065-9","volume":"14","author":"A Zanarini","year":"2009","unstructured":"Zanarini, A., Pesant, G.: Solution counting algorithms for constraint-centered search heuristics. Constraints 14(3), 392\u2013413 (2009)","journal-title":"Constraints"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30048-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,29]],"date-time":"2022-09-29T07:15:13Z","timestamp":1664435713000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30048-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030300470","9783030300487"],"references-count":60,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30048-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"23 September 2019","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":"Stamford, CT","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":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cp2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cp2019.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":"118","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":"46","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":"39% - 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.2","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":"4","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)"}}]}}