{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T07:28:15Z","timestamp":1743060495737,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030518240"},{"type":"electronic","value":"9783030518257"}],"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-51825-7_15","type":"book-chapter","created":{"date-parts":[[2020,6,30]],"date-time":"2020-06-30T23:00:13Z","timestamp":1593558013000},"page":"201-217","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Mycielski Graphs and PR Proofs"],"prefix":"10.1007","author":[{"given":"Emre","family":"Yolcu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xinyu","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marijn J. H.","family":"Heule","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,6,26]]},"reference":[{"key":"15_CR1","unstructured":"The On-Line Encyclopedia of Integer Sequences. Published electronically at \n                  https:\/\/oeis.org\/A122695"},{"key":"15_CR2","unstructured":"Biere, A.: CaDiCaL, Lingeling, Plingeling, Treengeling, YalSAT entering the SAT competition 2017. In: Proceedings of SAT Competition 2017 \u2013 Solver and Benchmark Descriptions. vol. B-2017-1, pp. 14\u201315 (2017)"},{"key":"15_CR3","unstructured":"Biere, A.: CaDiCaL at the SAT Race 2019. In: Proceedings of SAT Race 2019 \u2013 Solver and Benchmark Descriptions. vol. B-2019-1, pp. 8\u20139 (2019)"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Buss, S., Pitassi, T.: Resolution and the weak pigeonhole principle. In: Computer Science Logic, pp. 149\u2013156 (1998)","DOI":"10.1007\/BFb0028012"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Buss, S., Thapen, N.: DRAT proofs, propagation redundancy, and extended resolution. In: Theory and Applications of Satisfiability Testing \u2013 SAT 2019. pp. 71\u201389 (2019)","DOI":"10.1007\/978-3-030-24258-9_5"},{"issue":"2","key":"15_CR6","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/j.dam.2006.07.013","volume":"156","author":"M Caramia","year":"2008","unstructured":"Caramia, M., Dell\u2019Olmo, P.: Coloring graphs by iterated local search traversing feasible and infeasible solutions. Discrete Applied Mathematics 156(2), 201\u2013217 (2008)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"15_CR7","doi-asserted-by":"publisher","first-page":"36","DOI":"10.2307\/2273702","volume":"44","author":"SA Cook","year":"1979","unstructured":"Cook, S.A., Reckhow, R.A.: The relative efficiency of propositional proof systems. The Journal of Symbolic Logic 44(1), 36\u201350 (1979)","journal-title":"The Journal of Symbolic Logic"},{"key":"15_CR8","unstructured":"Crawford, J.M., Ginsberg, M.L., Luks, E.M., Roy, A.: Symmetry-breaking predicates for search problems. In: Proceedings of the Fifth International Conference on Principles of Knowledge Representation and Reasoning. pp. 148\u2013159 (1996)"},{"issue":"2","key":"15_CR9","doi-asserted-by":"publisher","first-page":"244","DOI":"10.1016\/j.dam.2006.07.019","volume":"156","author":"C Desrosiers","year":"2008","unstructured":"Desrosiers, C., Galinier, P., Hertz, A.: Efficient algorithms for finding critical subgraphs. Discrete Applied Mathematics 156(2), 244\u2013266 (2008)","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"15_CR10","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1016\/S1571-0661(05)82542-3","volume":"89","author":"N E\u00e9n","year":"2003","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Temporal induction by incremental SAT solving. Electronic Notes in Theoretical Computer Science 89(4), 543\u2013560 (2003)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"15_CR11","unstructured":"Goldberg, E., Novikov, Y.: Verification of proofs of unsatisfiability for CNF formulas. In: Proceedings of the Conference on Design, Automation and Test in Europe (DATE 2003). pp. 886\u2013891 (2003)"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Heule, M.J.H., Biere, A.: What a difference a variable makes. In: Tools and Algorithms for the Construction and Analysis of Systems. pp. 75\u201392 (2018)","DOI":"10.1007\/978-3-319-89963-3_5"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Heule, M.J.H., Kiesl, B., Biere, A.: Clausal proofs of mutilated chessboards. In: NASA Formal Methods. pp. 204\u2013210 (2019)","DOI":"10.1007\/978-3-030-20652-9_13"},{"issue":"3","key":"15_CR14","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1007\/s10817-019-09516-0","volume":"64","author":"MJH Heule","year":"2020","unstructured":"Heule, M.J.H., Kiesl, B., Biere, A.: Strong extension-free proof systems. Journal of Automated Reasoning 64(3), 533\u2013554 (2020)","journal-title":"Journal of Automated Reasoning"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1016\/S0166-218X(99)00037-2","volume":"96\u201397","author":"O Kullmann","year":"1999","unstructured":"Kullmann, O.: On a generalization of extended resolution. Discrete Applied Mathematics 96\u201397, 149\u2013176 (1999)","journal-title":"Discrete Applied Mathematics"},{"key":"15_CR16","unstructured":"Marques-Silva, J.P., Sakallah, K.A.: GRASP\u2014a new search algorithm for satisfiability. In: Proceedings of the 1996 IEEE\/ACM International Conference on Computer-Aided Design. pp. 220\u2013227 (1997)"},{"issue":"2","key":"15_CR17","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 graphs. Colloquium Mathematicae 3(2), 161\u2013162 (1955)","journal-title":"Colloquium Mathematicae"},{"key":"15_CR18","unstructured":"Ramani, A., Aloul, F.A., Markov, I.L., Sakallah, K.A.: Breaking instance-independent symmetries in exact graph coloring. In: Proceedings of the Conference on Design, Automation and Test in Europe (DATE 2004). pp. 324\u2013329 (2004)"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Schaafsma, B., Heule, M.J.H., van Maaren, H.: Dynamic symmetry breaking by simulating Zykov contraction. In: Theory and Applications of Satisfiability Testing \u2013 SAT 2009. pp. 223\u2013236 (2009)","DOI":"10.1007\/978-3-642-02777-2_22"},{"key":"15_CR20","doi-asserted-by":"crossref","unstructured":"Trick, M.A., Yildiz, H.: A large neighborhood search heuristic for graph coloring. In: Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems. pp. 346\u2013360 (2007)","DOI":"10.1007\/978-3-540-72397-4_25"},{"issue":"2","key":"15_CR21","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1016\/j.dam.2006.07.016","volume":"156","author":"A Van Gelder","year":"2008","unstructured":"Van Gelder, A.: Another look at graph coloring via propositional satisfiability. Discrete Applied Mathematics 156(2), 230\u2013243 (2008)","journal-title":"Discrete Applied Mathematics"},{"key":"15_CR22","doi-asserted-by":"crossref","unstructured":"Vinyals, M.: Hard examples for common variable decision heuristics. In: Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence (2020)","DOI":"10.1609\/aaai.v34i02.5527"},{"key":"15_CR23","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., Xu, R.: An exact algorithm with learning for the graph coloring problem. Computers and Operations Research 51, 282\u2013301 (2014)","journal-title":"Computers and Operations Research"},{"key":"15_CR24","doi-asserted-by":"crossref","unstructured":"Zhu, Q., Kitchen, N., Kuehlmann, A., Sangiovanni-Vincentelli, A.: SAT sweeping with local observability don\u2019t-cares. In: Proceedings of the 43rd Annual Design Automation Conference. pp. 229\u2013234 (2006)","DOI":"10.1145\/1146909.1146970"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2020"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-51825-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,7]],"date-time":"2020-08-07T23:09:45Z","timestamp":1596841785000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-51825-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030518240","9783030518257"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-51825-7_15","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":"26 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Satisfiability Testing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Alghero","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"3 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sat2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sat2020.idea-researchlab.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-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":"69","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":"25","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":"9","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":"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 (provided by the conference organizers)"}},{"value":"3","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":"6","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}