{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T23:05:49Z","timestamp":1778886349920,"version":"3.51.4"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319983332","type":"print"},{"value":"9783319983349","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-98334-9_1","type":"book-chapter","created":{"date-parts":[[2018,8,22]],"date-time":"2018-08-22T12:33:14Z","timestamp":1534941194000},"page":"3-12","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Automatic Discovery and Exploitation of Promising Subproblems for Tabulation"],"prefix":"10.1007","author":[{"given":"\u00d6zg\u00fcr","family":"Akg\u00fcn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian P.","family":"Gent","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christopher","family":"Jefferson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ian","family":"Miguel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Nightingale","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e1s Z.","family":"Salamon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,23]]},"reference":[{"key":"1_CR1","unstructured":"Mohr, R., Masini, G.: Good old discrete relaxation. In: Proceedings of ECAI 1988, pp. 651\u2013656. Pitman Publishing (1988)"},{"key":"1_CR2","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. AAAI Press (2007). http:\/\/www.aaai.org\/Papers\/AAAI\/2007\/AAAI07-029.pdf"},{"issue":"4","key":"1_CR3","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). https:\/\/doi.org\/10.1007\/s10601-011-9107-6","journal-title":"Constraints"},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Bessiere, C.: Constraint propagation. In: Handbook of Constraint Programming, pp. 29\u201383. Elsevier (2006)","DOI":"10.1016\/S1574-6526(06)80007-6"},{"issue":"3","key":"1_CR5","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.: Search in the patience game \u2018Black Hole\u2019. AI Communications 20(3), 211\u2013226 (2007). https:\/\/content.iospress.com\/articles\/ai-communications\/aic405","journal-title":"AI Communications"},{"key":"1_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-540-74970-7_8","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"A Gargani","year":"2007","unstructured":"Gargani, A., Refalo, P.: An efficient model and strategy for the steel mill slab design problem. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 77\u201389. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74970-7_8"},{"issue":"4","key":"1_CR7","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/s10601-017-9270-5","volume":"22","author":"JJ Dekker","year":"2017","unstructured":"Dekker, J.J., Bj\u00f6rdal, G., Carlsson, M., Flener, P., Monette, J.N.: Auto-tabling for subproblem presolving in MiniZinc. Constraints 22(4), 512\u2013529 (2017). https:\/\/doi.org\/10.1007\/s10601-017-9270-5","journal-title":"Constraints"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-540-74970-7_38","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"N Nethercote","year":"2007","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: MiniZinc: towards a standard cp modelling language. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529\u2013543. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74970-7_38"},{"key":"1_CR9","unstructured":"IBM Knowledge Center: The strong constraint (2017). https:\/\/www.ibm.com\/support\/knowledgecenter\/SSSA5P_12.8.0\/ilog.odms.ide.help\/OPL_Studio\/opllang_quickref\/topics\/tlr_oplsch_strong.html"},{"key":"1_CR10","unstructured":"Le Provost, T., Wallace, M.: Domain independent propagation. In: Proceedings of FGCS: International Conference on Fifth Generation Computer Systems, pp. 1004\u20131011. IOS Press (1992). http:\/\/www.webmail.eclipseclp.org\/reports\/corefgcs.pdf"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"590","DOI":"10.1007\/978-3-319-10428-7_43","volume-title":"Principles and Practice of Constraint Programming","author":"P Nightingale","year":"2014","unstructured":"Nightingale, P., Akg\u00fcn, \u00d6., Gent, I.P., Jefferson, C., Miguel, I.: Automatically improving constraint models in Savile Row through associative-commutative common subexpression elimination. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 590\u2013605. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10428-7_43"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1007\/978-3-319-23219-5_23","volume-title":"Principles and Practice of Constraint Programming","author":"P Nightingale","year":"2015","unstructured":"Nightingale, P., Spracklen, P., Miguel, I.: Automatically improving SAT encoding of constraint problems through common subexpression elimination in savile row. In: Pesant, G. (ed.) CP 2015. LNCS, vol. 9255, pp. 330\u2013340. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23219-5_23"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/j.artint.2017.07.001","volume":"251","author":"P Nightingale","year":"2017","unstructured":"Nightingale, P., Akg\u00fcn, O., Gent, I.P., Jefferson, C., Miguel, I., Spracklen, P.: Automatically improving constraint models in Savile Row. Artif. Intell. 251, 35\u201361 (2017). https:\/\/doi.org\/10.1016\/j.artint.2017.07.001","journal-title":"Artif. Intell."},{"key":"1_CR14","unstructured":"Nightingale, P., Rendl, A.: Essence\u2019 description (2016). arXiv:1601.02865 [cs.AI]"},{"issue":"2","key":"1_CR15","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10601-006-9007-3","volume":"12","author":"C Bessi\u00e8re","year":"2007","unstructured":"Bessi\u00e8re, C., Hebrard, E., Hnich, B., Walsh, T.: The complexity of reasoning with global constraints. Constraints 12(2), 239\u2013259 (2007). https:\/\/doi.org\/10.1007\/s10601-006-9007-3","journal-title":"Constraints"},{"key":"1_CR16","unstructured":"R\u00e9gin, J.C.: Generalized arc consistency for global cardinality constraint. In: Proceedings of AAAI 1996, pp. 209\u2013215. AAAI Press (1996). http:\/\/www.aaai.org\/Papers\/AAAI\/1996\/AAAI96-031.pdf"},{"key":"1_CR17","unstructured":"Gent, I.P., Jefferson, C., Miguel, I.: Minion: A fast scalable constraint solver. In: Proceedings of ECAI 2006, pp. 98\u2013102. IOS Press (2006). http:\/\/ebooks.iospress.nl\/volumearticle\/2658"},{"key":"1_CR18","unstructured":"Lecoutre, C., Sais, L., Tabary, S., Vidal, V.: Last conflict based reasoning. In: Proceedings of ECAI 2006, pp. 133\u2013137. IOS Press (2006). http:\/\/ebooks.iospress.nl\/volumearticle\/2665"},{"key":"1_CR19","unstructured":"Chu, G., Stuckey, P.J., Schutt, A., Ehlers, T., Gange, G., Francis, K.: Chuffed (2018). https:\/\/github.com\/chuffed\/chuffed\/"},{"key":"1_CR20","doi-asserted-by":"publisher","unstructured":"Akg\u00fcn, \u00d6., Gent, I.P., Jefferson, C., Miguel, I., Nightingale, P., Salamon, A.Z.: Tabulation experimental software and additional results (2018). https:\/\/doi.org\/10.5281\/zenodo.1290656 , https:\/\/github.com\/stacs-cp\/cp2018-tabulation","DOI":"10.5281\/zenodo.1290656"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/10704567_6","volume-title":"Principles and Practice of Declarative Programming","author":"P Hentenryck Van","year":"1999","unstructured":"Van Hentenryck, P., Michel, L., Perron, L., R\u00e9gin, J.-C.: Constraint programming in OPL. In: Nadathur, G. (ed.) PPDP 1999. LNCS, vol. 1702, pp. 98\u2013116. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/10704567_6"},{"key":"1_CR22","unstructured":"CSPLib: A problem library for constraints (1999). http:\/\/www.csplib.org"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Erdos, P., S\u00e1rk\u00f6zy, A.: On sets of coprime integers in intervals. Hardy-Ramanujan J. 16, 1\u201320 (1993). https:\/\/hal.archives-ouvertes.fr\/hal-01108688","DOI":"10.46298\/hrj.1993.126"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-98334-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,30]],"date-time":"2022-08-30T00:02:02Z","timestamp":1661817722000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-98334-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319983332","9783319983349"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98334-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"23 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Principles and Practice of Constraint Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lille","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cp2018.a4cp.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-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":"114","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"41","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,85","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3,75","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"}}]}}