{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:49:25Z","timestamp":1763642965740,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"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_31","type":"book-chapter","created":{"date-parts":[[2020,9,6]],"date-time":"2020-09-06T20:02:35Z","timestamp":1599422555000},"page":"531-547","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["HADDOCK: A Language and\u00a0Architecture for Decision Diagram Compilation"],"prefix":"10.1007","author":[{"given":"Rebecca","family":"Gentzel","sequence":"first","affiliation":[]},{"given":"Laurent","family":"Michel","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0023-753X","authenticated-orcid":false,"given":"W.-J.","family":"van Hoeve","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1109\/TC.1978.1675141","volume":"C\u201327","author":"SB Akers","year":"1978","unstructured":"Akers, S.B.: Binary decision diagrams. IEEE Trans. Comput. C\u201327, 509\u2013516 (1978)","journal-title":"IEEE Trans. Comput."},{"key":"31_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/978-3-540-74970-7_11","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"HR Andersen","year":"2007","unstructured":"Andersen, H.R., Hadzic, T., Hooker, J.N., Tiedemann, P.: A constraint store based on multivalued decision diagrams. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 118\u2013132. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74970-7_11"},{"key":"31_CR3","series-title":"North-Holland Mathematical Library","volume-title":"Hypergraphs - Combinatorics of Finite Sets","author":"C Berge","year":"1989","unstructured":"Berge, C.: Hypergraphs - Combinatorics of Finite Sets. North-Holland Mathematical Library, vol. 45. North-Holland, Amsterdam (1989)"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1613\/jair.4199","volume":"50","author":"D Bergman","year":"2014","unstructured":"Bergman, D., Cire, A.A., van Hoeve, W.-J.: MDD propagation for sequence constraints. JAIR 50, 697\u2013722 (2014)","journal-title":"JAIR"},{"key":"31_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-42849-9","volume-title":"Decision Diagrams for Optimization","author":"D Bergman","year":"2016","unstructured":"Bergman, D., Cire, A.A., van Hoeve, W.-J., Hooker, J.N.: Decision Diagrams for Optimization. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-319-42849-9"},{"issue":"1","key":"31_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1287\/ijoc.2015.0648","volume":"28","author":"D Bergman","year":"2016","unstructured":"Bergman, D., Cire, A.A., van Hoeve, W.-J., Hooker, J.N.: Discrete optimization with decision diagrams. INFORMS J. Comput. 28(1), 47\u201366 (2016)","journal-title":"INFORMS J. Comput."},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C\u201335","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Trans. Comput. C\u201335, 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1145\/136035.136043","volume":"24","author":"RE Bryant","year":"1992","unstructured":"Bryant, R.E.: Symbolic boolean manipulation with ordered binary decision diagrams. ACM Comput. Surv. 24, 293\u2013318 (1992)","journal-title":"ACM Comput. Surv."},{"key":"31_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-642-33558-7_18","volume-title":"Principles and Practice of Constraint Programming","author":"KCK Cheng","year":"2012","unstructured":"Cheng, K.C.K., Xia, W., Yap, R.H.C.: Space-time tradeoffs for the regular constraint. In: Milano, M. (ed.) CP 2012. LNCS, vol. 7514, pp. 223\u2013237. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33558-7_18"},{"key":"31_CR10","unstructured":"Cheng, K.C.K., Yap, R.H.C.: Maintaining generalized arc consistency on ad-hoc n-ary Boolean constraints. In Brewka, G., et al. (eds.) Proceedings of ECAI, pp. 78\u201382. IOS Press (2006)"},{"issue":"6","key":"31_CR11","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1287\/opre.2013.1221","volume":"61","author":"AA Cire","year":"2013","unstructured":"Cire, A.A., van Hoeve, W.-J.: Multivalued decision diagrams for sequencing problems. Oper. Res. 61(6), 1411\u20131428 (2013)","journal-title":"Oper. Res."},{"issue":"1","key":"31_CR12","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/s10601-018-9297-2","volume":"24","author":"D de U\u00f1a","year":"2019","unstructured":"de U\u00f1a, D., Gange, G., Schachte, P., Stuckey, P.J.: Compiling CP subproblems to MDDs and d-DNNFs. Constraints 24(1), 56\u201393 (2019). https:\/\/doi.org\/10.1007\/s10601-018-9297-2","journal-title":"Constraints"},{"key":"31_CR13","unstructured":"Gange, G., Lagoon, V., Stuckey, P.J.: Fast set bounds propagation using BDDs. In: Ghallab, M. et al. (eds.) Proceedings of ECAI, pp. 505\u2013509. IOS Press (2008)"},{"key":"31_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"340","DOI":"10.1007\/978-3-642-40627-0_28","volume-title":"Principles and Practice of Constraint Programming","author":"G Gange","year":"2013","unstructured":"Gange, G., Stuckey, P.J., Van Hentenryck, P.: Explaining propagators for edge-valued decision diagrams. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 340\u2013355. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40627-0_28"},{"issue":"4","key":"31_CR15","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s10601-011-9111-x","volume":"16","author":"G Gange","year":"2011","unstructured":"Gange, G., Stuckey, P.J., Szymanek, R.: MDD propagators with explanation. Constraints 16(4), 407\u2013429 (2011)","journal-title":"Constraints"},{"key":"31_CR16","doi-asserted-by":"crossref","unstructured":"Had\u017ei\u0107, T., Hooker, J.N.: Cost-bounded binary decision diagrams for 0\u20131 programming. Technical report, Carnegie Mellon University (2007)","DOI":"10.1007\/978-3-540-72397-4_7"},{"key":"31_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"448","DOI":"10.1007\/978-3-540-85958-1_30","volume-title":"Principles and Practice of Constraint Programming","author":"T Hadzic","year":"2008","unstructured":"Hadzic, T., Hooker, J.N., O\u2019Sullivan, B., Tiedemann, P.: Approximate compilation of constraints into multivalued decision diagrams. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol. 5202, pp. 448\u2013462. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-85958-1_30"},{"key":"31_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-540-68155-7_30","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"T Hadzic","year":"2008","unstructured":"Hadzic, T., Hooker, J.N., Tiedemann, P.: Propagating separable equalities in an MDD store. In: Perron, L., Trick, M.A. (eds.) CPAIOR 2008. LNCS, vol. 5015, pp. 318\u2013322. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68155-7_30"},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"Hadzic, T., O\u2019Mahony, E., O\u2019Sullivan, B., Sellmann, M.: Enhanced inference for the market split problem. In: Proceedings of ICTAI, pp. 716\u2013723. IEEE Computer Society (2009)","DOI":"10.1109\/ICTAI.2009.83"},{"issue":"1","key":"31_CR20","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1613\/jair.1638","volume":"24","author":"P Hawkins","year":"2005","unstructured":"Hawkins, P., Lagoon, V., Stuckey, P.J.: Solving set constraint satisfaction problems using ROBDDs. JAIR 24(1), 109\u2013156 (2005)","journal-title":"JAIR"},{"key":"31_CR21","unstructured":"Hoda, S.: Essays on equilibrium computation, MDD-based constraint programming and scheduling. Ph.D. thesis, Carnegie Mellon University (2010)"},{"key":"31_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-15396-9_23","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2010","author":"S Hoda","year":"2010","unstructured":"Hoda, S., van Hoeve, W.-J., Hooker, J.N.: A systematic approach to MDD-based constraint programming. In: Cohen, D. (ed.) CP 2010. LNCS, vol. 6308, pp. 266\u2013280. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15396-9_23"},{"issue":"7","key":"31_CR23","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1145\/360248.360251","volume":"19","author":"RM Keller","year":"1976","unstructured":"Keller, R.M.: Formal verification of parallel programs. Commun. ACM 19(7), 371\u2013384 (1976)","journal-title":"Commun. ACM"},{"issue":"3","key":"31_CR24","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1016\/j.ejor.2016.11.035","volume":"259","author":"J Kinable","year":"2017","unstructured":"Kinable, J., Cire, A.A., van Hoeve, W.-J.: Hybrid optimization methods for time-dependent sequencing problems. Eur. J. Oper. Res. 259(3), 887\u2013897 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"31_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/978-3-540-30201-8_27","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"V Lagoon","year":"2004","unstructured":"Lagoon, V., Stuckey, P.J.: Set domain propagation using ROBDDs. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 347\u2013361. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30201-8_27"},{"issue":"4","key":"31_CR26","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1002\/j.1538-7305.1959.tb01585.x","volume":"38","author":"C-Y Lee","year":"1959","unstructured":"Lee, C.-Y.: Representation of switching circuits by binary-decision programs. Bell Syst. Tech. J. 38(4), 985\u2013999 (1959)","journal-title":"Bell Syst. Tech. J."},{"key":"31_CR27","unstructured":"Michel, L., Schaus, P., Van Hentenryck, P.: MiniCP: a lightweight solver for constraint programming (2018). https:\/\/minicp.bitbucket.io"},{"key":"31_CR28","unstructured":"Perez, G., R\u00e9gin, J.-C.: Efficient operations on MDDs for building constraint programming models. In: Proceedings of IJCAI, pp. 374\u2013380 (2015)"},{"key":"31_CR29","doi-asserted-by":"crossref","unstructured":"Perez, G., R\u00e9gin, J.-C.: Soft and cost MDD propagators. In: Proceedings of AAAI, pp. 3922\u20133928. AAAI Press (2017)","DOI":"10.1609\/aaai.v31i1.11130"},{"key":"31_CR30","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719789","volume-title":"Branching Programs and Binary Decision Diagrams: Theory and Applications. SIAM Monographs on Discrete Mathematics and Applications","author":"I Wegener","year":"2000","unstructured":"Wegener, I.: Branching Programs and Binary Decision Diagrams: Theory and Applications. SIAM Monographs on Discrete Mathematics and Applications. Society for Industrial and Applied Mathematics, Philadelphia (2000)"}],"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_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,16]],"date-time":"2022-11-16T22:49:31Z","timestamp":1668638971000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58475-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030584740","9783030584757"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58475-7_31","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)"}}]}}