{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T23:56:54Z","timestamp":1794527814590,"version":"4.9.1"},"publisher-location":"Cham","reference-count":35,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319449524","type":"print"},{"value":"9783319449531","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-44953-1_14","type":"book-chapter","created":{"date-parts":[[2016,8,22]],"date-time":"2016-08-22T11:12:23Z","timestamp":1471864343000},"page":"207-223","source":"Crossref","is-referenced-by-count":31,"title":["Compact-Table: Efficiently Filtering Table Constraints with Reversible Sparse Bit-Sets"],"prefix":"10.1007","author":[{"given":"Jordan","family":"Demeulenaere","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Renaud","family":"Hartert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christophe","family":"Lecoutre","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guillaume","family":"Perez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Laurent","family":"Perron","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jean-Charles","family":"R\u00e9gin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Pierre","family":"Schaus","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,8,23]]},"reference":[{"key":"14_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)"},{"issue":"2","key":"14_CR2","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/j.artint.2005.02.004","volume":"165","author":"C Bessiere","year":"2005","unstructured":"Bessiere, C., R\u00e9gin, J.-C., Yap, R., Zhang, Y.: An optimal coarse-grained arc consistency algorithm. Artif. Intell. 165(2), 165\u2013185 (2005)","journal-title":"Artif. Intell."},{"key":"14_CR3","unstructured":"Bliek, C.: Wordwise algorithms and improved heuristics for solving hard constraint satisfaction problems. Technical Report 12\u201396-R045, ERCIM (1996)"},{"issue":"1\u20134","key":"14_CR4","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1145\/176454.176484","volume":"2","author":"P Briggs","year":"1993","unstructured":"Briggs, P., Torczon, L.: An efficient representation for sparse sets. ACM Lett. Programm. Lang. Syst. 2(1\u20134), 59\u201369 (1993)","journal-title":"ACM Lett. Programm. Lang. Syst."},{"key":"14_CR5","unstructured":"Van Cauwelaert, S., Lombardi, M., Schaus, P.: A visual web tool to perform what-if analysis of optimization approaches. Technical report, UCLouvain (2016)"},{"issue":"2","key":"14_CR6","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":"14_CR7","unstructured":"Demeulenaere, J.: Efficient algorithms for table constraints. Technical report, Master Thesis, under the supervision of P. Schauss, UCLouvain (2015)"},{"issue":"2","key":"14_CR8","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."},{"issue":"4","key":"14_CR9","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1145\/321420.321422","volume":"14","author":"RW Floyd","year":"1967","unstructured":"Floyd, R.W.: Nondeterministic algorithms. J. ACM 14(4), 636\u2013644 (1967)","journal-title":"J. ACM"},{"key":"14_CR10","unstructured":"Gent, I.P., 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":"14_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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, Heidelberg (2014)"},{"issue":"1","key":"14_CR12","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/s10601-013-9156-0","volume":"19","author":"P Hentenryck Van","year":"2014","unstructured":"Van Hentenryck, P., Mairy, J.-B., Deville, Y.: Optimal and efficient filtering algorithms for table constraints. Constraints 19(1), 77\u2013120 (2014)","journal-title":"Constraints"},{"key":"14_CR13","unstructured":"Jefferson, C., Nightingale, P.: Extending simple tabular reduction with short supports. In: Proceedings of IJCAI 2013, pp. 573\u2013579 (2013)"},{"key":"14_CR14","doi-asserted-by":"crossref","unstructured":"Katsirelos, G., Walsh, T.: A compression algorithm for large arity extensional constraints. In: Proceedings of CP 2007, pp. 379\u2013393 (2007)","DOI":"10.1007\/978-3-540-74970-7_28"},{"key":"14_CR15","unstructured":"Knuth, D.E.: The Art of Computer: Combinatorial Algorithms, vol. 4. Addison-Wesley (2015)"},{"key":"14_CR16","unstructured":"de Saint-Marcq, V.C., Schaus, P., Solnon, C., Lecoutre, C.: Sparse-sets for domain implementation. In: Proceeding of TRICS 2013, pp. 1\u201310 (2013)"},{"issue":"4","key":"14_CR17","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":"14_CR18","doi-asserted-by":"crossref","unstructured":"Lecoutre, C., Boussemart, F., Hemery, F.: Exploiting multidirectionality in coarse-grained arc consistency algorithms. In: Proceedings of CP 2003, pp. 480\u2013494 (2003)","DOI":"10.1007\/978-3-540-45193-8_33"},{"key":"14_CR19","unstructured":"Lecoutre, C., Hemery, F.: A study of residual supports in arc consistency. In: Proceedings of IJCAI 2007, pp. 125\u2013130 (2007)"},{"key":"14_CR20","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":"14_CR21","doi-asserted-by":"crossref","unstructured":"Lecoutre, C., Szymanek, R.: Generalized arc consistency for positive table constraints. In: Proceedings of CP 2006, pp. 284\u2013298 (2006)","DOI":"10.1007\/11889205_22"},{"key":"14_CR22","first-page":"21","volume":"2d","author":"C Lecoutre","year":"2008","unstructured":"Lecoutre, C., Vion, J.: Enforcing arc consistency using bitwise operations. Constraint Program. Lett. 2d, 21\u201335 (2008)","journal-title":"Constraint Program. Lett."},{"key":"14_CR23","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":"14_CR24","unstructured":"Likitvivatanavong, C., Zhang, Y., Bowen, J., Freuder, E.C.: Arc consistency in MAC: a new perspective. In: Proceedings of CPAI 2004 Workshop held with CP 2004, pp. 93\u2013107 (2004)"},{"issue":"1","key":"14_CR25","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"AK Mackworth","year":"1977","unstructured":"Mackworth, A.K.: Consistency in networks of relations. Artif. Intell. 8(1), 99\u2013118 (1977)","journal-title":"Artif. Intell."},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Mairy, J.-B., van Hentenryck, P., Deville, Y.: An optimal filtering algorithm for table constraints. In: Proceedings of CP 2012, pp. 496\u2013511 (2012)","DOI":"10.1007\/978-3-642-33558-7_37"},{"key":"14_CR27","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0020-0255(79)90023-9","volume":"19","author":"JJ McGregor","year":"1979","unstructured":"McGregor, J.J.: Relational consistency algorithms and their application in finding subgraph and graph isomorphisms. Inf. Sci. 19, 229\u2013250 (1979)","journal-title":"Inf. Sci."},{"key":"14_CR28","unstructured":"Mohr, R., Masini, G.: Good old discrete relaxation. In: Proceedings of ECAI 1988, pp. 651\u2013656 (1988)"},{"key":"14_CR29","unstructured":"Team, O.: OscaR: Scala in OR (2012). https:\/\/bitbucket.org\/oscarlib\/oscar"},{"key":"14_CR30","doi-asserted-by":"crossref","unstructured":"Perez, G., R\u00e9gin, J.-C.: Improving GAC-4 for table and MDD constraints. In: Proceedings of CP 2014, pp. 606\u2013621 (2014)","DOI":"10.1007\/978-3-319-10428-7_44"},{"key":"14_CR31","doi-asserted-by":"crossref","unstructured":"Srinivasan, A., Kam, T., Malik, S., Brayton, R.K.: Algorithms for discrete function manipulation. In: Proceedings of ICCAD 1990, pp. 92\u201395 (1990)","DOI":"10.1109\/ICCAD.1990.129849"},{"issue":"1","key":"14_CR32","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/321921.321925","volume":"23","author":"JR Ullmann","year":"1976","unstructured":"Ullmann, J.R.: An algorithm for subgraph isomorphism. J. ACM 23(1), 31\u201342 (1976)","journal-title":"J. ACM"},{"key":"14_CR33","doi-asserted-by":"crossref","first-page":"3639","DOI":"10.1016\/j.ins.2007.03.030","volume":"177","author":"JR Ullmann","year":"2007","unstructured":"Ullmann, J.R.: Partition search for non-binary constraint satisfaction. Inf. Sci. 177, 3639\u20133678 (2007)","journal-title":"Inf. Sci."},{"key":"14_CR34","unstructured":"Wang, R., Xia, W., Yap, R., Li, Z.: Optimizing simple table reduction with bitwise representation. In: Proceedings of IJCAI 2016 (2016)"},{"key":"14_CR35","doi-asserted-by":"crossref","unstructured":"Xia, W., Yap, R.: Optimizing STR algorithms with tuple compression. In: Proceedings of CP 2013, pp. 724\u2013732 (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-44953-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T17:07:51Z","timestamp":1498324071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44953-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319449524","9783319449531"],"references-count":35,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44953-1_14","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-319-44953-1","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]}}}