{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T10:43:52Z","timestamp":1756464232624},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319661575"},{"type":"electronic","value":"9783319661582"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-66158-2_19","type":"book-chapter","created":{"date-parts":[[2017,8,22]],"date-time":"2017-08-22T07:24:38Z","timestamp":1503386678000},"page":"297-307","source":"Crossref","is-referenced-by-count":10,"title":["Extending Compact-Table to Basic Smart Tables"],"prefix":"10.1007","author":[{"given":"H\u00e9l\u00e8ne","family":"Verhaeghe","sequence":"first","affiliation":[]},{"given":"Christophe","family":"Lecoutre","sequence":"additional","affiliation":[]},{"given":"Yves","family":"Deville","sequence":"additional","affiliation":[]},{"given":"Pierre","family":"Schaus","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,8,23]]},"reference":[{"key":"19_CR1","unstructured":"Bessiere, C., R\u00e9gin, J.C.: Arc consistency for general constraint networks: preliminary results. In: Proceedings of IJCAI 1997, pp. 398\u2013404 (1997)"},{"key":"19_CR2","unstructured":"Bliek, C.: Wordwise algorithms and improved heuristics for solving hard constraint satisfaction problems. Technical report 12\u201396-R045, ERCIM (1996)"},{"key":"19_CR3","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":"2","key":"19_CR4","doi-asserted-by":"crossref","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":"19_CR5","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., Hartert, R., Lecoutre, C., Perez, G., Perron, L., R\u00e9gin, J.-C., Schaus, P.: 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). doi: 10.1007\/978-3-319-44953-1_14"},{"issue":"2","key":"19_CR6","doi-asserted-by":"crossref","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. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"19_CR7","unstructured":"Gent, I., Jefferson, C., Miguel, I., Nightingale, P.: Data structures for generalised arc consistency for extensional constraints. In: Proceedings of AAAI 2007, pp. 191\u2013197 (2007)"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-319-07046-9_9","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"N Gharbi","year":"2014","unstructured":"Gharbi, N., Hemery, F., Lecoutre, C., Roussel, O.: Sliced table constraints: combining compression and tabular reduction. In: Simonis, H. (ed.) CPAIOR 2014. LNCS, vol. 8451, pp. 120\u2013135. Springer, Cham (2014). doi: 10.1007\/978-3-319-07046-9_9"},{"issue":"1","key":"19_CR9","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s10601-013-9156-0","volume":"19","author":"JB Mairy","year":"2014","unstructured":"Mairy, J.B., Van Hentenryck, P., Deville, Y.: Optimal and efficient filtering algorithms for table constraints. Constraints 19(1), 77\u2013120 (2014)","journal-title":"Constraints"},{"key":"19_CR10","unstructured":"Jefferson, C., Nightingale, P.: Extending simple tabular reduction with short supports. In: Proceedings of IJCAI 2013, pp. 573\u2013579 (2013)"},{"key":"19_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/978-3-540-74970-7_28","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"G Katsirelos","year":"2007","unstructured":"Katsirelos, G., Walsh, T.: A compression algorithm for large arity extensional constraints. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 379\u2013393. Springer, Heidelberg (2007). doi: 10.1007\/978-3-540-74970-7_28"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Khot, S., Saket, R.: Hardness of minimizing and learning DNF expressions. In: IEEE 49th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2008, pp. 231\u2013240. IEEE (2008)","DOI":"10.1109\/FOCS.2008.37"},{"issue":"4","key":"19_CR13","doi-asserted-by":"crossref","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":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"480","DOI":"10.1007\/978-3-540-45193-8_33","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2003","author":"C Lecoutre","year":"2003","unstructured":"Lecoutre, C., Boussemart, F., Hemery, F.: Exploiting multidirectionality in coarse-grained arc consistency algorithms. In: Rossi, F. (ed.) CP 2003. LNCS, vol. 2833, pp. 480\u2013494. Springer, Heidelberg (2003). doi: 10.1007\/978-3-540-45193-8_33"},{"key":"19_CR15","unstructured":"Lecoutre, C., Hemery, F.: A study of residual supports in arc consistency. In: Proceedings of IJCAI 2007, pp. 125\u2013130 (2007)"},{"key":"19_CR16","doi-asserted-by":"crossref","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":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1007\/11889205_22","volume-title":"Principles and Practice of Constraint Programming - CP 2006","author":"C Lecoutre","year":"2006","unstructured":"Lecoutre, C., Szymanek, R.: Generalized arc consistency for positive table constraints. In: Benhamou, F. (ed.) CP 2006. LNCS, vol. 4204, pp. 284\u2013298. Springer, Heidelberg (2006). doi: 10.1007\/11889205_22"},{"key":"19_CR18","first-page":"21","volume":"2","author":"C Lecoutre","year":"2008","unstructured":"Lecoutre, C., Vion, J.: Enforcing arc consistency using bitwise operations. Constraint Program. Lett. 2, 21\u201335 (2008)","journal-title":"Constraint Program. Lett."},{"key":"19_CR19","unstructured":"Lhomme, O., R\u00e9gin, J.C.: A fast arc consistency algorithm for n-ary constraints. In: Proceedings of AAAI 2005, pp. 405\u2013410 (2005)"},{"key":"19_CR20","unstructured":"Likitvivatanavong, C., Zhang, Y., Bowen, J., Freuder, E.: Arc consistency in MAC: a new perspective. In: Proceedings of CPAI\u201904 Workshop held with CP 2004, pp. 93\u2013107 (2004)"},{"key":"19_CR21","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). doi: 10.1007\/978-3-319-18008-3_19"},{"key":"19_CR22","unstructured":"van Omme, N., Perron, L., Furnon, V.: or-tools user\u2019s manual. Technical report, Google (2014). https:\/\/github.com\/google\/or-tools"},{"key":"19_CR23","unstructured":"OscaR Team: OscaR: Scala in OR (2012). https:\/\/bitbucket.org\/oscarlib\/oscar"},{"key":"19_CR24","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). doi: 10.1007\/978-3-319-10428-7_44"},{"key":"19_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). doi: 10.1007\/978-3-540-30201-8_36"},{"key":"19_CR26","unstructured":"Prud\u2019homme, C., Fages, J.G., Lorca, X.: Choco3 documentation. TASC, INRIA Rennes, LINA CNRS UMR 6241 (2014)"},{"key":"19_CR27","unstructured":"de Saint-Marcq, V.L.C., Schaus, P., Solnon, C., Lecoutre, C.: Sparse-sets for domain implementation. In: (TRICS) Workshop on Techniques for Implementing Constraint Programming Systems (2013)"},{"key":"19_CR28","doi-asserted-by":"crossref","first-page":"3639","DOI":"10.1016\/j.ins.2007.03.030","volume":"177","author":"J Ullmann","year":"2007","unstructured":"Ullmann, J.: Partition search for non-binary constraint satisfaction. Inf. Sci. 177, 3639\u20133678 (2007)","journal-title":"Inf. Sci."},{"key":"19_CR29","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":"19_CR30","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)"},{"key":"19_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"724","DOI":"10.1007\/978-3-642-40627-0_53","volume-title":"Principles and Practice of Constraint Programming","author":"W Xia","year":"2013","unstructured":"Xia, W., Yap, R.H.C.: Optimizing STR algorithms with tuple compression. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 724\u2013732. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-40627-0_53"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-66158-2_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,2]],"date-time":"2019-10-02T17:13:10Z","timestamp":1570036390000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-66158-2_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319661575","9783319661582"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-66158-2_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}