{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,7,16]],"date-time":"2023-07-16T09:10:19Z","timestamp":1689498619571},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,8,30]],"date-time":"2014-08-30T00:00:00Z","timestamp":1409356800000},"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":["Constraints"],"published-print":{"date-parts":[[2015,1]]},"DOI":"10.1007\/s10601-014-9171-9","type":"journal-article","created":{"date-parts":[[2014,8,29]],"date-time":"2014-08-29T14:21:49Z","timestamp":1409322109000},"page":"100-108","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improving the lower bound of simple tabular reduction"],"prefix":"10.1007","volume":"20","author":[{"given":"Christophe","family":"Lecoutre","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chavalit","family":"Likitvivatanavong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roland H. C.","family":"Yap","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,8,30]]},"reference":[{"issue":"1\u20134","key":"9171_CR1","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1145\/176454.176484","volume":"2","author":"P Briggs","year":"1993","unstructured":"Briggs, P., & Torczon, L. (1993). An efficient representation for sparse sets. ACM Letters on Programming Languages and Systems, 2 (1\u20134), 59\u201369.","journal-title":"ACM Letters on Programming Languages and Systems"},{"issue":"2","key":"9171_CR2","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/s10601-009-9087-y","volume":"15","author":"KCK Cheng","year":"2010","unstructured":"Cheng, K.C.K., & Yap, R.H.C. (2010). An MDD-based generalized arc consistency algorithm for positive and negative table constraints and some global constraints. Constraints, 15 (2), 265\u2013304.","journal-title":"Constraints"},{"issue":"4","key":"9171_CR3","doi-asserted-by":"crossref","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. (2011). MDD propagators with explanation. Constraints, 16 (4), 407\u2013429.","journal-title":"Constraints"},{"key":"9171_CR4","unstructured":"Jefferson, C., & Nightingale, P. (2013). Extending simple tabular reduction with short supports. In Proceedings of IJCAI-13 (pp. 573\u2013579)."},{"issue":"4","key":"9171_CR5","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1007\/s10601-011-9107-6","volume":"16","author":"C Lecoutre","year":"2011","unstructured":"Lecoutre, C. (2011). STR2: Optimized simple tabular reduction for table constraints. Constraints, 16 (4), 341\u2013371.","journal-title":"Constraints"},{"key":"9171_CR6","unstructured":"Lecoutre, C., Likitvivatanavong, C., Yap, R.H.C. (2012). A path-optimal GAC algorithm for table constraints. In Proceedings of ECAI-12 (pp. 510\u2013515)."},{"key":"9171_CR7","doi-asserted-by":"crossref","unstructured":"Lecoutre, C., Paparrizou, A., Stergiou, K. (2013). Extending STR to a higher-order consistency. In Proceedings of AAAI-13 (pp. 576\u2013582).","DOI":"10.1609\/aaai.v27i1.8622"},{"key":"9171_CR8","unstructured":"Likitvivatanavong, C., Zhang, Y., Shannon, S., Bowen, J., Freuder, E.C. (2007). Arc consistency during search. In Proceedings of IJCAI-07 (pp. 137\u2013142)."},{"key":"9171_CR9","doi-asserted-by":"crossref","unstructured":"Mairy, J.-B., Hentenryck, P.V., Deville, Y. (2012). An optimal filtering algorithm for table constraints. In Proceedings of CP-12 (pp. 496\u2013511).","DOI":"10.1007\/978-3-642-33558-7_37"},{"issue":"18","key":"9171_CR10","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. (2007). Partition search for non-binary constraint satisfaction. Information Science, 177 (18), 3639\u20133678.","journal-title":"Information Science"},{"key":"9171_CR11","doi-asserted-by":"crossref","unstructured":"Xia, W., & Yap, R.H.C. (2013). Optimizing STR algorithm with tuple compression. In Proceedings of CP-13 (pp. 724\u2013732).","DOI":"10.1007\/978-3-642-40627-0_53"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-014-9171-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-014-9171-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-014-9171-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,16]],"date-time":"2023-07-16T08:53:30Z","timestamp":1689497610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-014-9171-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,30]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2015,1]]}},"alternative-id":["9171"],"URL":"https:\/\/doi.org\/10.1007\/s10601-014-9171-9","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,8,30]]}}}