{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T05:35:26Z","timestamp":1743140126529,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030192112"},{"type":"electronic","value":"9783030192129"}],"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-19212-9_39","type":"book-chapter","created":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T10:32:32Z","timestamp":1558348352000},"page":"581-598","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Extending Compact-Diagram to Basic Smart Multi-Valued Variable Diagrams"],"prefix":"10.1007","author":[{"given":"H\u00e9l\u00e8ne","family":"Verhaeghe","sequence":"first","affiliation":[]},{"given":"Christophe","family":"Lecoutre","sequence":"additional","affiliation":[]},{"given":"Pierre","family":"Schaus","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,4,28]]},"reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"Amilhastre, J., Fargier, H., Niveau, A., Pralet, C.: Compiling CSPs: a complexity map of (non-deterministic) multivalued decision diagrams. Int. J. Artif. Intell. Tools 23(04) (2014)","DOI":"10.1142\/S021821301460015X"},{"key":"39_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":"39_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/978-3-540-30201-8_11","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"N Beldiceanu","year":"2004","unstructured":"Beldiceanu, N., Carlsson, M., Petit, T.: Deriving filtering algorithms from constraint checkers. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 107\u2013122. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30201-8_11"},{"key":"39_CR4","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1613\/jair.4199","volume":"50","author":"D Bergman","year":"2014","unstructured":"Bergman, D., Cir\u00e9, A., van Hoeve, W.: MDD propagation for sequence constraints. J. Artif. Intell. Res. 50, 697\u2013722 (2014)","journal-title":"J. Artif. Intell. Res."},{"key":"39_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., Cir\u00e9, A., van Hoeve, W., Hooker, J.: Decision Diagrams for Optimization. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-42849-9"},{"key":"39_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/978-3-540-73580-9_9","volume-title":"Abstraction, Reformulation, and Approximation","author":"C Bessiere","year":"2007","unstructured":"Bessiere, C., Hebrard, E., Hnich, B., Kiziltan, Z., Quimper, C.-G., Walsh, T.: Reformulating global constraints: the Slide and Regular constraints. In: Miguel, I., Ruml, W. (eds.) SARA 2007. LNCS (LNAI), vol. 4612, pp. 80\u201392. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73580-9_9"},{"key":"39_CR7","unstructured":"Boussemart, F., Lecoutre, C., Piette, C.: XCSP3: an integrated format for benchmarking combinatorial constrained problems. Technical report. arXiv:1611.03398 , CoRR (2016). http:\/\/www.xcsp.org"},{"issue":"8","key":"39_CR8","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"35","author":"R Bryant","year":"1986","unstructured":"Bryant, R.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. 35(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"key":"39_CR9","doi-asserted-by":"crossref","unstructured":"Cappart, Q., Goutierre, E., Bergman, D., Rousseau, L.M.: Improving optimization bounds using machine learning: decision diagrams meet deep reinforcement learning. In: Proceedings of AAAI 2019 (2019)","DOI":"10.1609\/aaai.v33i01.33011443"},{"issue":"2","key":"39_CR10","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/s10601-009-9087-y","volume":"15","author":"K Cheng","year":"2010","unstructured":"Cheng, K., Yap, R.: An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints. Constraints 15(2), 265\u2013304 (2010)","journal-title":"Constraints"},{"key":"39_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-319-44953-1_14","volume-title":"Principles and Practice of Constraint Programming","author":"J Demeulenaere","year":"2016","unstructured":"Demeulenaere, J., et al.: Compact-table: efficiently filtering table constraints with reversible sparse bit-sets. In: Rueher, M. (ed.) CP 2016. LNCS, vol. 9892, pp. 207\u2013223. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44953-1_14"},{"issue":"2","key":"39_CR12","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Programm. 91(2), 201\u2013213 (2002)","journal-title":"Math. Programm."},{"issue":"4","key":"39_CR13","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., Szymanek, R.: MDD propagators with explanation. Constraints 16(4), 407\u2013429 (2011)","journal-title":"Constraints"},{"key":"39_CR14","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":"39_CR15","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"},{"key":"39_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-319-98334-9_14","volume-title":"Principles and Practice of Constraint Programming","author":"L Ingmar","year":"2018","unstructured":"Ingmar, L., Schulte, C.: Making compact-table compact. In: Hooker, J. (ed.) CP 2018. LNCS, vol. 11008, pp. 210\u2013218. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98334-9_14"},{"key":"39_CR17","unstructured":"Le Charlier, B., Khong, M.T., Lecoutre, C., Deville, Y.: Automatic synthesis of smart table constraints by abstraction of table constraints"},{"issue":"4","key":"39_CR18","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/s10601-011-9107-6","volume":"16","author":"C Lecoutre","year":"2011","unstructured":"Lecoutre, C.: STR2: optimized simple tabular reduction for table constraints. Constraints 16(4), 341\u2013371 (2011)","journal-title":"Constraints"},{"key":"39_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2014.12.002","volume":"220","author":"C Lecoutre","year":"2015","unstructured":"Lecoutre, C., Likitvivatanavong, C., Yap, R.: STR3: a path-optimal filtering algorithm for table constraints. Artif. Intell. 220, 1\u201327 (2015)","journal-title":"Artif. Intell."},{"key":"39_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/978-3-319-18008-3_19","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"J-B Mairy","year":"2015","unstructured":"Mairy, J.-B., Deville, Y., Lecoutre, C.: The smart table constraint. In: Michel, L. (ed.) CPAIOR 2015. LNCS, vol. 9075, pp. 271\u2013287. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18008-3_19"},{"key":"39_CR21","unstructured":"OscaR Team: OscaR: Scala in OR (2012). https:\/\/bitbucket.org\/oscarlib\/oscar"},{"key":"39_CR22","unstructured":"Perez, G.: Decision diagrams: constraints and algorithms. Ph.D. thesis, Universit\u00e9 de Nice (2017)"},{"key":"39_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1007\/978-3-319-10428-7_44","volume-title":"Principles and Practice of Constraint Programming","author":"G Perez","year":"2014","unstructured":"Perez, G., R\u00e9gin, J.-C.: Improving GAC-4 for table and MDD constraints. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 606\u2013621. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10428-7_44"},{"key":"39_CR24","unstructured":"Perez, G., R\u00e9gin, J.C.: Efficient operations ON MDDs for building constraint programming models. In: Twenty-Fourth International Joint Conference on Artificial Intelligence (2015)"},{"key":"39_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"482","DOI":"10.1007\/978-3-540-30201-8_36","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"G Pesant","year":"2004","unstructured":"Pesant, G.: A regular language membership constraint for finite sequences of variables. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 482\u2013495. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30201-8_36"},{"key":"39_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"786","DOI":"10.1007\/978-3-319-44953-1_49","volume-title":"Principles and Practice of Constraint Programming","author":"P Roy","year":"2016","unstructured":"Roy, P., Perez, G., R\u00e9gin, J.-C., Papadopoulos, A., Pachet, F., Marchini, M.: Enforcing structure on temporal sequences: the allen constraint. In: Rueher, M. (ed.) CP 2016. LNCS, vol. 9892, pp. 786\u2013801. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44953-1_49"},{"key":"39_CR27","unstructured":"le Cl\u00e9ment de Saint-Marcq, V., Schaus, P., Solnon, C., Lecoutre, C.: Sparse-sets for domain implementation. In: Proceeding of TRICS 2013, pp. 1\u201310 (2013)"},{"issue":"1","key":"39_CR28","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/s10601-018-9297-2","volume":"24","author":"D U\u00f1a de","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)","journal-title":"Constraints"},{"key":"39_CR29","doi-asserted-by":"crossref","unstructured":"Verhaeghe, H., Lecoutre, C., Schaus, P.: Compact-MDD: efficiently filtering (s)MDD constraints with reversible sparse bit-sets. In: IJCAI, pp. 1383\u20131389 (2018)","DOI":"10.24963\/ijcai.2018\/192"},{"key":"39_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-319-66158-2_19","volume-title":"Principles and Practice of Constraint Programming","author":"H Verhaeghe","year":"2017","unstructured":"Verhaeghe, H., Lecoutre, C., Deville, Y., Schaus, P.: Extending compact-table to basic smart tables. In: Beck, J.C. (ed.) CP 2017. LNCS, vol. 10416, pp. 297\u2013307. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66158-2_19"},{"key":"39_CR31","doi-asserted-by":"crossref","unstructured":"Verhaeghe, H., Lecoutre, C., Schaus, P.: Extending compact-table to negative and short tables. In: Proceedings of AAAI 2017 (2017)","DOI":"10.1007\/978-3-319-66158-2_19"},{"key":"39_CR32","unstructured":"Wang, R., Xia, W., Yap, R., Li, Z.: Optimizing Simple Tabular Reduction with a bitwise representation. In: Proceedings of IJCAI 2016, pp. 787\u2013795 (2016)"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-19212-9_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,25]],"date-time":"2019-11-25T16:58:42Z","timestamp":1574701122000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-19212-9_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030192112","9783030192129"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-19212-9_39","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":"28 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Thessaloniki","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","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":"4 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2019b","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cpaior2019.uowm.gr\/","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"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"94","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"34","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"9","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"36% - 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"}},{"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"}},{"value":"5.67","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}