{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:39:47Z","timestamp":1742913587043,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319983332"},{"type":"electronic","value":"9783319983349"}],"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_12","type":"book-chapter","created":{"date-parts":[[2018,8,22]],"date-time":"2018-08-22T12:33:14Z","timestamp":1534941194000},"page":"179-194","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Clause Learning and New Bounds for Graph Coloring"],"prefix":"10.1007","author":[{"given":"Emmanuel","family":"Hebrard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"George","family":"Katsirelos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,23]]},"reference":[{"issue":"1","key":"12_CR1","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s10479-007-0178-0","volume":"153","author":"KI Aardal","year":"2007","unstructured":"Aardal, K.I., Van Hoesel, S.P.M., Koster, A.M.C.A., Mannino, C., Sassano, A.: Models and solution techniques for frequency assignment problems. Ann. Oper. Res. 153(1), 79\u2013129 (2007)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"12_CR2","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1145\/359094.359101","volume":"22","author":"D Br\u00e9laz","year":"1979","unstructured":"Br\u00e9laz, D.: New methods to color the vertices of a graph. Commun. ACM 22(4), 251\u2013256 (1979)","journal-title":"Commun. ACM"},{"issue":"1","key":"12_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0096-0551(81)90048-5","volume":"6","author":"GJ Chaitin","year":"1981","unstructured":"Chaitin, G.J., Auslander, M.A., Chandra, A.K., Cocke, J., Hopkins, M.E., Markstein, P.W.: Register allocation via coloring. Comput. Lang. 6(1), 47\u201357 (1981)","journal-title":"Comput. Lang."},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1613\/jair.4591","volume":"52","author":"B Cat De","year":"2015","unstructured":"De Cat, B., Denecker, M., Bruynooghe, M., Stuckey, P.: Lazy model expansion: interleaving grounding with search. J. Artif. Intell. Res. 52, 235\u2013286 (2015)","journal-title":"J. Artif. Intell. Res."},{"key":"12_CR5","doi-asserted-by":"publisher","first-page":"3.1-3.21","DOI":"10.1145\/2543629","volume":"18","author":"David Eppstein","year":"2013","unstructured":"Eppstein, D., L\u00f6ffler, M., Strash, D.: Listing all maximal cliques in large sparse real-world graphs. ACM J. Exp. Algorithmics 18(3.1\u20133.21) (2013)","journal-title":"Journal of Experimental Algorithmics"},{"key":"12_CR6","unstructured":"Frost, D., Dechter, R.: Look-ahead value ordering for constraint satisfaction problems. In: Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-1995), pp. 572\u2013578 (1995)"},{"key":"12_CR7","unstructured":"Gomes, C., Selman, B., Kautz, H.: Boosting combinatorial search through randomization. In: Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-1998), pp. 431\u2013438 (1998)"},{"key":"12_CR8","unstructured":"Huang, J.: The effect of restarts on the efficiency of clause learning. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-2007) (2007)"},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Jiang, H., Li, C.-M., Many\u00e0, F.: An exact algorithm for the maximum weight clique problem in large graphs. In: Proceedings of the 31st Conference on Artificial Intelligence (AAAI-2017), pp. 830\u2013838 (2017)","DOI":"10.1609\/aaai.v31i1.10648"},{"key":"12_CR10","unstructured":"Katsirelos, G., Bacchus, F.: Generalized nogoods in CSPs. In: Proceedings of the 20th National Conference on Artificial Intelligence (AAAI-2005), pp. 390\u2013396 (2005)"},{"key":"12_CR11","doi-asserted-by":"publisher","first-page":"1082","DOI":"10.4153\/CJM-1970-125-1","volume":"22","author":"DR Lick","year":"1970","unstructured":"Lick, D.R., White, A.T.: k-degenerate graphs. Can. J. Math. 22, 1082\u20131096 (1970)","journal-title":"Can. J. Math."},{"key":"12_CR12","doi-asserted-by":"crossref","unstructured":"Lin, J., Cai, S., Luo, C., Su, K.: A reduction based method for coloring very large graphs. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI-2017), pp. 517\u2013523 (2017)","DOI":"10.24963\/ijcai.2017\/73"},{"issue":"5","key":"12_CR13","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"JP Marques-Silva","year":"1999","unstructured":"Marques-Silva, J.P., Sakallah, K.A.: GRASP\u2013a search algorithm for propositional satisfiability. IEEE Trans. Comput. 48(5), 506\u2013521 (1999)","journal-title":"IEEE Trans. Comput."},{"issue":"4","key":"12_CR14","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1287\/ijoc.8.4.344","volume":"8","author":"A Mehrotra","year":"1996","unstructured":"Mehrotra, A., Trick, M.A.: A column generation approach for graph coloring. INFORMS J. Comput. 8(4), 344\u2013354 (1996)","journal-title":"INFORMS J. Comput."},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proceedings of the 39th Design Automation Conference (DAC-2001), pp. 530\u2013535 (2001)","DOI":"10.1145\/378239.379017"},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"161","DOI":"10.4064\/cm-3-2-161-162","volume":"3","author":"J Mycielski","year":"1955","unstructured":"Mycielski, J.: Sur le coloriage des graphes. Colloq. Math 3, 161\u2013162 (1955)","journal-title":"Colloq. Math"},{"key":"12_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"544","DOI":"10.1007\/978-3-540-74970-7_39","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"O Ohrimenko","year":"2007","unstructured":"Ohrimenko, O., Stuckey, P.J., Codish, M.: Propagation = lazy clause generation. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 544\u2013558. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74970-7_39"},{"issue":"2","key":"12_CR18","doi-asserted-by":"publisher","first-page":"258","DOI":"10.15807\/jorsj.39.258","volume":"39","author":"T Park","year":"1996","unstructured":"Park, T., Lee, C.Y.: Application of the graph coloring algorithm to the frequency assignment problem. J. Oper. Res. Soc. Jpn. 39(2), 258\u2013265 (1996)","journal-title":"J. Oper. Res. Soc. Jpn."},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1007\/978-3-642-02777-2_22","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2009","author":"B Schaafsma","year":"2009","unstructured":"Schaafsma, B., Heule, M.J.H., van Maaren, H.: Dynamic symmetry breaking by simulating zykov contraction. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 223\u2013236. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02777-2_22"},{"key":"12_CR20","unstructured":"Stergiou, K.: Heuristics for dynamically adapting propagation. In: Proceedings of the 18th European Conference on Artificial Intelligence (ECAI-2008), pp. 485\u2013489 (2008)"},{"key":"12_CR21","unstructured":"Trick, M.A. (ed.): Computational Symposium on Graph Coloring and its Generalizations (COLOR-2002) (2002)"},{"issue":"2","key":"12_CR22","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/j.dam.2006.07.016","volume":"156","author":"A Gelder Van","year":"2008","unstructured":"Van Gelder, A.: Another look at graph coloring via propositional satisfiability. Discrete Appl. Math. 156(2), 230\u2013243 (2008)","journal-title":"Discrete Appl. Math."},{"key":"12_CR23","unstructured":"Van Hentenryck, P., \u00c5gren, M., Flener, P., Pearson, J.: Tractable symmetry breaking for CSPs with interchangeable values. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-2003), pp. 277\u2013282 (2003)"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Walsh, T.: Breaking value symmetry. In: Proceedings of the 23rd National Conference on Artificial Intelligence (AAAI-2008), pp. 880\u2013887 (2008)","DOI":"10.1007\/978-3-540-74970-7_67"},{"key":"12_CR25","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.cor.2014.05.017","volume":"51","author":"Z Zhou","year":"2014","unstructured":"Zhou, Z., Li, C.-M., Huang, C., Ruchu, X.: An exact algorithm with learning for the graph coloring problem. Comput. Oper. Res. 51, 282\u2013301 (2014)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"12_CR26","first-page":"163","volume":"24(66)","author":"AA Zykov","year":"1949","unstructured":"Zykov, A.A.: On some properties of linear complexes. Mat. Sb. (N.S.) 24(66)(2), 163\u2013188 (1949). http:\/\/mi.mathnet.ru\/eng\/msb5974","journal-title":"Mat. Sb. (N.S.)"}],"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_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,30]],"date-time":"2022-08-30T00:03:35Z","timestamp":1661817815000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-98334-9_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319983332","9783319983349"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98334-9_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"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"}}]}}