{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:53:08Z","timestamp":1743123188069,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030584740"},{"type":"electronic","value":"9783030584757"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-58475-7_8","type":"book-chapter","created":{"date-parts":[[2020,9,6]],"date-time":"2020-09-06T20:02:35Z","timestamp":1599422555000},"page":"126-142","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Strengthening Neighbourhood Substitution"],"prefix":"10.1007","author":[{"given":"Martin C.","family":"Cooper","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"key":"8_CR1","doi-asserted-by":"publisher","unstructured":"Bessiere, C.: Constraint propagation. In: Rossi et al. [26], pp. 29\u201383. https:\/\/doi.org\/10.1016\/S1574-6526(06)80007-6","DOI":"10.1016\/S1574-6526(06)80007-6"},{"key":"8_CR2","unstructured":"Bessi\u00e8re, C., Debruyne, R.: Optimal and suboptimal singleton arc consistency algorithms. In: Kaelbling, L.P., Saffiotti, A. (eds.) IJCAI-2005, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, pp. 54\u201359. Professional Book Center (2005). http:\/\/ijcai.org\/Proceedings\/05\/Papers\/0495.pdf"},{"issue":"2","key":"8_CR3","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/j.artint.2005.02.004","volume":"165","author":"C Bessi\u00e8re","year":"2005","unstructured":"Bessi\u00e8re, C., R\u00e9gin, J., Yap, R.H.C., Zhang, Y.: An optimal coarse-grained arc consistency algorithm. Artif. Intell. 165(2), 165\u2013185 (2005). https:\/\/doi.org\/10.1016\/j.artint.2005.02.004","journal-title":"Artif. Intell."},{"issue":"2","key":"8_CR4","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10601-014-9173-7","volume":"20","author":"G Chu","year":"2014","unstructured":"Chu, G., Stuckey, P.J.: Dominance breaking constraints. Constraints Int. J. 20(2), 155\u2013182 (2014). https:\/\/doi.org\/10.1007\/s10601-014-9173-7","journal-title":"Constraints Int. J."},{"issue":"1","key":"8_CR5","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/0004-3702(71)90005-1","volume":"2","author":"MB Clowes","year":"1971","unstructured":"Clowes, M.B.: On seeing things. Artif. Intell. 2(1), 79\u2013116 (1971). https:\/\/doi.org\/10.1016\/0004-3702(71)90005-1","journal-title":"Artif. Intell."},{"issue":"7","key":"8_CR6","doi-asserted-by":"publisher","first-page":"1127","DOI":"10.1016\/j.jcss.2015.02.001","volume":"81","author":"DA Cohen","year":"2015","unstructured":"Cohen, D.A., Cooper, M.C., Escamocher, G., Zivny, S.: Variable and value elimination in binary constraint satisfaction via forbidden patterns. J. Comput. Syst. Sci. 81(7), 1127\u20131143 (2015). https:\/\/doi.org\/10.1016\/j.jcss.2015.02.001","journal-title":"J. Comput. Syst. Sci."},{"issue":"1\u20132","key":"8_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0004-3702(96)00018-5","volume":"90","author":"MC Cooper","year":"1997","unstructured":"Cooper, M.C.: Fundamental properties of neighbourhood substitution in constraint satisfaction problems. Artif. Intell. 90(1\u20132), 1\u201324 (1997). https:\/\/doi.org\/10.1016\/S0004-3702(96)00018-5","journal-title":"Artif. Intell."},{"issue":"2","key":"8_CR8","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s11263-006-9783-7","volume":"73","author":"MC Cooper","year":"2007","unstructured":"Cooper, M.C.: Constraints between distant lines in the labelling of line drawings of polyhedral scenes. Int. J. Comput. Vis. 73(2), 195\u2013212 (2007). https:\/\/doi.org\/10.1007\/s11263-006-9783-7","journal-title":"Int. J. Comput. Vis."},{"key":"8_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84800-229-6","volume-title":"Line Drawing Interpretation","author":"MC Cooper","year":"2008","unstructured":"Cooper, M.C.: Line Drawing Interpretation. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-1-84800-229-6"},{"key":"8_CR10","unstructured":"Cooper, M.C.: Strengthening neighbourhood substitution. CoRR abs\/2007.06282 (2020). https:\/\/arxiv.org\/abs\/2007.06282"},{"key":"8_CR11","doi-asserted-by":"publisher","first-page":"196","DOI":"10.1016\/j.artint.2016.02.001","volume":"234","author":"MC Cooper","year":"2016","unstructured":"Cooper, M.C., Duchein, A., Mouelhi, A.E., Escamocher, G., Terrioux, C., Zanuttini, B.: Broken triangles: from value merging to a tractable class of general-arity constraint satisfaction problems. Artif. Intell. 234, 196\u2013218 (2016). https:\/\/doi.org\/10.1016\/j.artint.2016.02.001","journal-title":"Artif. Intell."},{"key":"8_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-319-44953-1_12","volume-title":"Principles and Practice of Constraint Programming","author":"MC Cooper","year":"2016","unstructured":"Cooper, M.C., El\u00a0Mouelhi, A., Terrioux, C.: Extending broken triangles and enhanced value-merging. In: Rueher, M. (ed.) CP 2016. LNCS, vol. 9892, pp. 173\u2013188. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-44953-1_12"},{"key":"8_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-319-98334-9_5","volume-title":"Principles and Practice of Constraint Programming","author":"MC Cooper","year":"2018","unstructured":"Cooper, M.C., Jguirim, W., Cohen, D.A.: Domain reduction for valued constraints by generalising methods from CSP. In: Hooker, J. (ed.) CP 2018. LNCS, vol. 11008, pp. 64\u201380. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98334-9_5"},{"key":"8_CR14","unstructured":"Freuder, E.C.: Eliminating interchangeable values in constraint satisfaction problems. In: Dean, T.L., McKeown, K.R. (eds.) Proceedings of the 9th National Conference on Artificial Intelligence, vol. 1, pp. 227\u2013233. AAAI Press\/The MIT Press (1991). http:\/\/www.aaai.org\/Library\/AAAI\/1991\/aaai91-036.php"},{"key":"8_CR15","unstructured":"Freuder, E.C., Wallace, R.J.: Replaceability and the substitutability hierarchy for constraint satisfaction problems. In: Benzm\u00fcller, C., Lisetti, C.L., Theobald, M. (eds.) GCAI 2017, 3rd Global Conference on Artificial Intelligence. EPiC Series in Computing, vol. 50, pp. 51\u201363. EasyChair (2017). http:\/\/www.easychair.org\/publications\/paper\/mKkF"},{"issue":"3","key":"8_CR16","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","volume":"1","author":"MR Garey","year":"1976","unstructured":"Garey, M.R., Johnson, D.S., Stockmeyer, L.J.: Some simplified NP-complete graph problems. Theor. Comput. Sci. 1(3), 237\u2013267 (1976). https:\/\/doi.org\/10.1016\/0304-3975(76)90059-1","journal-title":"Theor. Comput. Sci."},{"key":"8_CR17","doi-asserted-by":"publisher","unstructured":"Gent, I.P., Petrie, K.E., Puget, J.: Symmetry in constraint programming. In: Rossi et al. [26], pp. 329\u2013376. https:\/\/doi.org\/10.1016\/S1574-6526(06)80014-3","DOI":"10.1016\/S1574-6526(06)80014-3"},{"key":"8_CR18","doi-asserted-by":"publisher","unstructured":"van Hoeve, W., Katriel, I.: Global constraints. In: Rossi et al. [26], pp. 169\u2013208. https:\/\/doi.org\/10.1016\/S1574-6526(06)80010-6","DOI":"10.1016\/S1574-6526(06)80010-6"},{"key":"8_CR19","unstructured":"Huffman, D.A.: Impossible objects as nonsense sentences. In: Meltzer, B., Michie, D. (eds.) Machine Intelligence, vol. 6, pp. 295\u2013323. Edinburgh University Press (1971)"},{"key":"8_CR20","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Proceedings of Symposium on the Complexity of Computer Computations. The IBM Research Symposia Series, pp. 85\u2013103. Plenum Press, New York (1972). http:\/\/www.cs.berkeley.edu\/%7Eluca\/cs172\/karp.pdf"},{"key":"8_CR21","doi-asserted-by":"publisher","DOI":"10.1002\/9780470611821","volume-title":"Constraint Networks Techniques and Algorithms","author":"C Lecoutre","year":"2009","unstructured":"Lecoutre, C.: Constraint Networks Techniques and Algorithms. ISTE\/Wiley, Hoboken (2009)"},{"key":"8_CR22","doi-asserted-by":"publisher","unstructured":"Likitvivatanavong, C., Yap, R.H.C.: Many-to-many interchangeable sets of values in CSPs. In: Shin, S.Y., Maldonado, J.C. (eds.) Proceedings of the 28th Annual ACM Symposium on Applied Computing, SAC 2013, pp. 86\u201391. ACM (2013). https:\/\/doi.org\/10.1145\/2480362.2480382","DOI":"10.1145\/2480362.2480382"},{"issue":"1","key":"8_CR23","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1016\/0004-3702(77)90007-8","journal-title":"Artif. Intell."},{"issue":"2","key":"8_CR24","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/0004-3702(86)90083-4","volume":"28","author":"R Mohr","year":"1986","unstructured":"Mohr, R., Henderson, T.C.: Arc and path consistency revisited. Artif. Intell. 28(2), 225\u2013233 (1986). https:\/\/doi.org\/10.1016\/0004-3702(86)90083-4","journal-title":"Artif. Intell."},{"key":"8_CR25","unstructured":"Naanaa, W.: New schemes for simplifying binary constraint satisfaction problems. Discrete Math. Theor. Comput. Sci. (2019)"},{"volume-title":"Handbook of Constraint Programming, Foundations of Artificial Intelligence","year":"2006","key":"8_CR26","unstructured":"Rossi, F., van Beek, P., Walsh, T. (eds.): Handbook of Constraint Programming, Foundations of Artificial Intelligence, vol. 2. Elsevier, Amsterdam (2006). http:\/\/www.sciencedirect.com\/science\/bookseries\/15746526\/2"},{"key":"8_CR27","series-title":"Computer Science Series","first-page":"19","volume-title":"The Psychology of Computer Vision","author":"D Waltz","year":"1975","unstructured":"Waltz, D.: Understanding line drawings of scenes with shadows. In: Winston, P.H. (ed.) The Psychology of Computer Vision. Computer Science Series, pp. 19\u201391. McGraw-Hill, New York (1975)"},{"key":"8_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1007\/978-3-642-33558-7_50","volume-title":"Principles and Practice of Constraint Programming","author":"RJ Woodward","year":"2012","unstructured":"Woodward, R.J., Karakashian, S., Choueiry, B.Y., Bessiere, C.: Revisiting neighborhood inverse consistency on binary CSPs. In: Milano, M. (ed.) CP 2012. LNCS, pp. 688\u2013703. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33558-7_50"}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58475-7_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T05:26:45Z","timestamp":1619242005000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58475-7_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030584740","9783030584757"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58475-7_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"2 September 2020","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":"Louvain-la-Neuve","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cp2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cp2020.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 (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"122","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"55","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"45% - 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 (provided by the conference organizers)"}},{"value":"3.13","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.47","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}