{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T05:52:27Z","timestamp":1743054747079,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"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_19","type":"book-chapter","created":{"date-parts":[[2019,9,22]],"date-time":"2019-09-22T19:03:06Z","timestamp":1569178986000},"page":"317-332","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Estimating the Number of Solutions of Cardinality Constraints Through $$\\texttt {range}$$ and $$\\texttt {roots}$$ Decompositions"],"prefix":"10.1007","author":[{"given":"Giovanni Lo","family":"Bianco","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xavier","family":"Lorca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Charlotte","family":"Truchet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,23]]},"reference":[{"issue":"12","key":"19_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0895-7177(94)90127-9","volume":"20","author":"N Beldiceanu","year":"1994","unstructured":"Beldiceanu, N., Contejean, E.: Introducing global constraints in chip. Math. Comput. Modell. 20(12), 97\u2013123 (1994). \n                      https:\/\/doi.org\/10.1016\/0895-7177(94)90127-9\n                      \n                    . \n                      http:\/\/www.sciencedirect.com\/science\/article\/pii\/0895717794901279","journal-title":"Math. Comput. Modell."},{"issue":"11","key":"19_CR2","doi-asserted-by":"publisher","first-page":"1054","DOI":"10.1016\/j.artint.2009.03.001","volume":"173","author":"C Bessiere","year":"2009","unstructured":"Bessiere, C., Hebrard, E., Hnich, B., Kiziltan, Z., Walsh, T.: Range and roots: two common patterns for specifying and propagating counting and occurrence constraints. Artif. Intell. 173(11), 1054\u20131078 (2009). \n                      https:\/\/doi.org\/10.1016\/j.artint.2009.03.001","journal-title":"Artif. Intell."},{"key":"19_CR3","unstructured":"Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: de M\u00e1ntaras, R.L., Saitta, L. (eds.) Proceedings of the 16th European Conference on Artificial Intelligence, ECAI 2004, Including Prestigious Applicants of Intelligent Systems, PAIS 2004, Valencia, Spain, 22\u201327 August 2004, pp. 146\u2013150. IOS Press (2004)"},{"key":"19_CR4","unstructured":"Carlsson, M., Fruehwirth, T.: Sicstus PROLOG user\u2019s manual 4.3. Books On Demand - Proquest (2014)"},{"key":"19_CR5","unstructured":"Erdos, P., Renyi, A.: On random matrices. Publication of the Mathematical Institute of the Hungarian Academy of Science (1963)"},{"key":"19_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-319-93031-2_17","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"S Gagnon","year":"2018","unstructured":"Gagnon, S., Pesant, G.: Accelerating counting-based search. In: van Hoeve, W.-J. (ed.) CPAIOR 2018. LNCS, vol. 10848, pp. 245\u2013253. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-93031-2_17"},{"key":"19_CR7","unstructured":"Gomes, C., Shmoys, D.: Completing quasigroups or latin squares: a structured graph coloring problem, January 2002"},{"key":"19_CR8","unstructured":"Gomes, C.P., Hoffmann, J., Sabharwal, A., Selman, B.: From sampling to model counting. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence, IJCAI 2007, Hyderabad, India, 6\u201312 January 2007, pp. 2293\u20132299 (2007)"},{"key":"19_CR9","unstructured":"Meel, K.S., et al.: Constrained sampling and counting: universal hashing meets SAT solving. CoRR abs\/1512.06633 (2015). \n                      http:\/\/arxiv.org\/abs\/1512.06633"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-29828-8_15","volume-title":"Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems","author":"L Michel","year":"2012","unstructured":"Michel, L., Van Hentenryck, P.: Activity-based search for black-box constraint programming solvers. In: Beldiceanu, N., Jussien, N., Pinson, \u00c9. (eds.) CPAIOR 2012. LNCS, vol. 7298, pp. 228\u2013243. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-29828-8_15"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-540-48085-3_24","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 1999","author":"F Pachet","year":"1999","unstructured":"Pachet, F., Roy, P.: Automatic generation of music programs. In: Jaffar, J. (ed.) CP 1999. LNCS, vol. 1713, pp. 331\u2013345. Springer, Heidelberg (1999). \n                      https:\/\/doi.org\/10.1007\/978-3-540-48085-3_24"},{"key":"19_CR12","unstructured":"Pesant, G.: CSPLib problem 067: quasigroup completion. \n                      http:\/\/www.csplib.org\/Problems\/prob067"},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1613\/jair.3463","volume":"43","author":"G Pesant","year":"2012","unstructured":"Pesant, G., Quimper, C., Zanarini, A.: Counting-based search: branching heuristics for constraint satisfaction problems. J. Artif. Intell. Res. 43, 173\u2013210 (2012). \n                      https:\/\/doi.org\/10.1613\/jair.3463","journal-title":"J. Artif. Intell. Res."},{"key":"19_CR14","unstructured":"Prud\u2019homme, C., Fages, J.G., Lorca, X.: Choco solver documentation. TASC, INRIA Rennes, LINA CNRS UMR 6241, COSLING S.A.S. (2016). \n                      http:\/\/www.choco-solver.org"},{"key":"19_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-540-30201-8_41","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"P Refalo","year":"2004","unstructured":"Refalo, P.: Impact-based search strategies for constraint programming. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 557\u2013571. Springer, Heidelberg (2004). \n                      https:\/\/doi.org\/10.1007\/978-3-540-30201-8_41"},{"key":"19_CR16","unstructured":"R\u00e9gin, J.: A filtering algorithm for constraints of difference in CSPS, pp. 362\u2013367 (1994)"},{"key":"19_CR17","unstructured":"Russell, S.J., Norvig, P.: Artificial Intelligence - A Modern Approach, 3rd edn. Pearson Education, London (2010). \n                      http:\/\/vig.pearsoned.com\/store\/home\/1,1205,store-14563_id-294438,00.html"},{"key":"19_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139058520","volume-title":"Enumerative Combinatorics: Volume 1","author":"RP Stanley","year":"2011","unstructured":"Stanley, R.P.: Enumerative Combinatorics: Volume 1, 2nd edn. Cambridge University Press, Cambridge (2011)","edition":"2"},{"key":"19_CR19","unstructured":"Walsh, T.: CSPLib problem 026: sports tournament scheduling. \n                      http:\/\/www.csplib.org\/Problems\/prob026"}],"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_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,25]],"date-time":"2019-09-25T16:05:13Z","timestamp":1569427513000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30048-7_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030300470","9783030300487"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30048-7_19","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)"}}]}}