{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:17:09Z","timestamp":1740122229165,"version":"3.37.3"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,6,6]],"date-time":"2017-06-06T00:00:00Z","timestamp":1496707200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Vetenskapsr\u00e5det (SE)","award":["2015-4910"],"award-info":[{"award-number":["2015-4910"]}]},{"DOI":"10.13039\/501100007051","name":"Uppsala University","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100007051","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Constraints"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s10601-017-9270-5","type":"journal-article","created":{"date-parts":[[2017,6,6]],"date-time":"2017-06-06T03:33:55Z","timestamp":1496720035000},"page":"512-529","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Auto-tabling for subproblem presolving in MiniZinc"],"prefix":"10.1007","volume":"22","author":[{"given":"Jip J.","family":"Dekker","sequence":"first","affiliation":[]},{"given":"Gustav","family":"Bj\u00f6rdal","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3079-8095","authenticated-orcid":false,"given":"Mats","family":"Carlsson","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8730-4098","authenticated-orcid":false,"given":"Pierre","family":"Flener","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5734-5881","authenticated-orcid":false,"given":"Jean-No\u00ebl","family":"Monette","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,6,6]]},"reference":[{"issue":"2","key":"9270_CR1","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/976706.976707","volume":"5","author":"S Abdennadher","year":"2004","unstructured":"Abdennadher, S., & Rigotti, C. (2004). Automatic generation of rule-based constraint solvers over finite domains. ACM Transactions on Computational Logic, 5(2), 177\u2013205.","journal-title":"ACM Transactions on Computational Logic"},{"key":"9270_CR2","doi-asserted-by":"crossref","unstructured":"Belov, G., Stuckey, P.J., Tack, G., & Wallace, M. (2016). Improved linearization of constraint programming models. In Rueher, M. (Ed.), CP 2016, LNCS, (Vol. 9892 pp. 49\u201365): Springer.","DOI":"10.1007\/978-3-319-44953-1_4"},{"key":"9270_CR3","doi-asserted-by":"crossref","unstructured":"Bergman, D., Cire, A.A., van Hoeve, W.J., & Hooker, J. (2016). Decision diagrams for optimization. Springer.","DOI":"10.1007\/978-3-319-42849-9"},{"key":"9270_CR4","doi-asserted-by":"crossref","unstructured":"Bessi\u00e8re, C., & R\u00e9gin, J.C. (1999). Enforcing arc consistency on global constraints by solving subproblems on the fly. In Jaffar, J. (Ed.), CP 1999, LNCS, (Vol. 1713 pp. 103\u2013117): Springer.","DOI":"10.1007\/978-3-540-48085-3_8"},{"issue":"3","key":"9270_CR5","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1007\/s10601-015-9184-z","volume":"20","author":"G Bj\u00f6rdal","year":"2015","unstructured":"Bj\u00f6rdal, G., Monette, J.N., Flener, P., & Pearson, J. (2015). A constraint-based local search backend for MiniZinc. Constraints, 20(3), 325\u2013345.","journal-title":"Constraints"},{"key":"9270_CR6","doi-asserted-by":"crossref","unstructured":"Bofill, M., Suy, J., & Villaret, M. (2010). A system for solving constraint satisfaction problems with SMT. In Strichman, O., & Szeider, S. (Eds.), SAT 2010, LNCS, (Vol. 6175 pp. 300\u2013305): Springer.","DOI":"10.1007\/978-3-642-14186-7_25"},{"issue":"3","key":"9270_CR7","doi-asserted-by":"crossref","first-page":"1180","DOI":"10.1016\/j.ejor.2016.11.033","volume":"259","author":"M Carlsson","year":"2017","unstructured":"Carlsson, M., Johansson, M., & Larson, J. (2017). Scheduling double round-robin tournaments with divisional play using constraint programming. European Journal of Operational Research, 259(3), 1180\u20131190.","journal-title":"European Journal of Operational Research"},{"key":"9270_CR8","doi-asserted-by":"crossref","unstructured":"Carlsson, M., Ottosson, G., & Carlson, B. (1997). An open-ended finite domain constraint solver. In Glaser, H., Hartel, P., & Kuchen, H. (Eds.), PLILP 1997, LNCS, (Vol. 1292 pp. 191\u2013206): Springer.","DOI":"10.1007\/BFb0033845"},{"key":"9270_CR9","doi-asserted-by":"crossref","unstructured":"Cheng, K.C.K., & Yap, R.H.C. (2008). Maintaining generalized arc consistency on ad hoc r-ary constraints. In Stuckey, P.J. (Ed.), CP 2008, LNCS, (Vol. 5202 pp. 509\u2013523): Springer.","DOI":"10.1007\/978-3-540-85958-1_34"},{"key":"9270_CR10","volume-title":"Improving combinatorial optimization. Ph.D. thesis, Department of Computing and Information Systems","author":"G Chu","year":"2011","unstructured":"Chu, G. (2011). Improving combinatorial optimization. Ph.D. thesis, Department of Computing and Information Systems. Australia: University of Melbourne."},{"key":"9270_CR11","unstructured":"De Cat, B., Bogaerts, B., Devriendt, J., & Denecker, M. (2013). Model expansion in the presence of function symbols using constraint programming. In Brodsky, A. (Ed.), ICTAI 2013 (pp. 1068\u20131075): IEEE. The MinisatID solver is available from \n                        https:\/\/dtai.cs.kuleuven.be\/software\/minisatid\n                        \n                    ."},{"key":"9270_CR12","unstructured":"De Landtsheer, R., & Ponsard, C. (2013). OscaR.cbls: An open source framework for constraint-based local search, ORBEL-27, the 27th annual conference of the Belgian Operational Research Society. Available at \n                        http:\/\/www.orbel.be\/orbel27\/pdf\/abstract293.pdf\n                        \n                    ; the OscaR.cbls solver is available from \n                        https:\/\/bitbucket.org\/oscarlib\/oscar\/branch\/CBLS\n                        \n                    ."},{"key":"9270_CR13","unstructured":"Dekker, J.J. (2016). Sub-problem pre-solving in MiniZinc. Master\u2019s thesis, Department of Information Technology, Uppsala University, Sweden. Available at \n                        http:\/\/urn.kb.se\/resolve?urn=urn:nbn:se:uu:diva-307145\n                        \n                    ."},{"key":"9270_CR14","doi-asserted-by":"crossref","unstructured":"Demeulenaere, J., Hartert, R., Lecoutre, C., Perez, G., Perron, L., R\u00e9gin, J., & Schaus, P. (2016). Compact-table: Efficiently filtering table constraints with reversible sparse bit-sets. In Rueher, M. (Ed.), CP 2016, LNCS, (Vol. 9892 pp. 207\u2013223): Springer.","DOI":"10.1007\/978-3-319-44953-1_14"},{"key":"9270_CR15","doi-asserted-by":"crossref","unstructured":"E\u00e9n, N., & Biere, A. (2005). Effective preprocessing in SAT through variable and clause elimination. In Bacchus, F., & Walsh, T. (Eds.), SAT 2005, LNCS, (Vol. 3569 pp. 61\u201375): Springer.","DOI":"10.1007\/11499107_5"},{"key":"9270_CR16","unstructured":"Gecode Team (2016). Gecode: A generic constraint development environment. \n                        http:\/\/www.gecode.org\n                        \n                    ."},{"issue":"3","key":"9270_CR17","first-page":"211","volume":"20","author":"IP Gent","year":"2007","unstructured":"Gent, I.P., Jefferson, C., Kelsey, T., Lynce, I., Miguel, I., Nightingale, P., Smith, B.M., & Tarim, S.A. (2007). Search in the patience game \u2019black hole\u2019. AI Communications, 20(3), 211\u2013226.","journal-title":"AI Communications"},{"key":"9270_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.artint.2014.03.001","volume":"211","author":"IP Gent","year":"2014","unstructured":"Gent, I.P., Jefferson, C., Linton, S., Miguel, I., & Nightingale, P. (2014). Generating custom propagators for arbitrary constraints. Artificial Intelligence, 211, 1\u201333.","journal-title":"Artificial Intelligence"},{"key":"9270_CR19","unstructured":"Google Optimization Team (2016). or-tools: Google\u2019s software suite for combinatorial optimization. \n                        https:\/\/developers.google.com\/optimization\n                        \n                    ."},{"key":"9270_CR20","unstructured":"IBM Knowledge Center. The strong constraint. \n                        http:\/\/www.ibm.com\/support\/knowledgecenter\/SSSA5P_12.6.3\/ilog.odms.ide.help\/OPL_Studio\/opllang_quickref\/topics\/tlr_oplsch_strong.html\n                        \n                    ."},{"issue":"2","key":"9270_CR21","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1515\/jqas-2013-0090","volume":"10","author":"J Larson","year":"2014","unstructured":"Larson, J., & Johansson, M. (2014). Constructing schedules for sports leagues with divisional and round-robin tournaments. Journal of Quantitative Analysis in Sports, 10 (2), 119\u2013129.","journal-title":"Journal of Quantitative Analysis in Sports"},{"key":"9270_CR22","doi-asserted-by":"crossref","unstructured":"Larson, J., Johansson, M., & Carlsson, M. (2014). An integrated constraint programming approach to scheduling sports leagues with divisional and round-robin tournaments. In Simonis, H. (Ed.), CPAIOR 2014, LNCS, (Vol. 8451 pp. 144\u2013158): Springer.","DOI":"10.1007\/978-3-319-07046-9_11"},{"key":"9270_CR23","unstructured":"Le Provost, T., & Wallace, M. (1992). Domain independent propagation, FGCS 1992, International conference on fifth generation computer systems (pp. 1004\u20131011): IOS Press."},{"key":"9270_CR24","unstructured":"Leo, K., & Tack, G. (2015). Multi-pass high-level presolving. In Yang, Q., & Wooldridge, M. (Eds.), IJCAI 2015 (pp. 346\u2013352): AAAI Press."},{"key":"9270_CR25","doi-asserted-by":"crossref","unstructured":"Monette, J.N., Flener, P., & Pearson, J. (2015). Automated auxiliary variable elimination through on-the-fly propagator generation. In Pesant, G. (Ed.), CP 2015, LNCS, (Vol. 9255 pp. 313\u2013329): Springer.","DOI":"10.1007\/978-3-319-23219-5_22"},{"key":"9270_CR26","doi-asserted-by":"crossref","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., & Tack, G. (2007). MiniZinc: Towards a standard CP modelling language. In Bessi\u00e8re, C. (Ed.), CP 2007, LNCS. The MiniZinc toolchain is available at \n                        http:\/\/www.minizinc.org\n                        \n                    , (Vol. 4741 pp. 529\u2013543): Springer.","DOI":"10.1007\/978-3-540-74970-7_38"},{"key":"9270_CR27","unstructured":"Parlett, D. (Ed.) (1990). The Penguin Book of Patience. London: Penguin."},{"key":"9270_CR28","doi-asserted-by":"crossref","unstructured":"Pesant, G. (2004). A regular language membership constraint for finite sequences of variables. In Wallace, M. (Ed.), CP 2004, LNCS, (Vol. 3258 pp. 482\u2013495): Springer.","DOI":"10.1007\/978-3-540-30201-8_36"},{"key":"9270_CR29","doi-asserted-by":"crossref","unstructured":"Rendl, A., Guns, T., Stuckey, P.J., & Tack, G. (2015). MiniSearch: A solver-independent meta-search language for MiniZinc. In Pesant, G. (Ed.), CP 2015, LNCS, (Vol. 9255 pp. 376\u2013392): Springer.","DOI":"10.1007\/978-3-319-23219-5_27"},{"key":"9270_CR30","unstructured":"Simonis, H. (2008). Kakuro as a constraint problem. In Flener, P., & Simonis, H. (Eds.), ModRef 2018, the 7th International Workshop on Constraint Modelling and Reformulation. \n                        https:\/\/www.it.uu.se\/research\/group\/astra\/ModRef08\/Simonis.pdf\n                        \n                    ."}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-017-9270-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-017-9270-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-017-9270-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,8,16]],"date-time":"2017-08-16T01:06:00Z","timestamp":1502845560000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-017-9270-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,6]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["9270"],"URL":"https:\/\/doi.org\/10.1007\/s10601-017-9270-5","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"type":"print","value":"1383-7133"},{"type":"electronic","value":"1572-9354"}],"subject":[],"published":{"date-parts":[[2017,6,6]]}}}