{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:18:52Z","timestamp":1742912332026,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031479625"},{"type":"electronic","value":"9783031479632"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-47963-2_2","type":"book-chapter","created":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T21:41:26Z","timestamp":1700689286000},"page":"4-14","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Without Loss of Satisfaction"],"prefix":"10.1007","author":[{"given":"Marijn J. H.","family":"Heule","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,23]]},"reference":[{"issue":"1\u20133","key":"2_CR1","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1016\/S0304-3975(03)00395-5","volume":"310","author":"M Alekhnovich","year":"2004","unstructured":"Alekhnovich, M.: Mutilated chessboard problem is exponentially hard for resolution. Theoret. Comput. Sci. 310(1\u20133), 513\u2013525 (2004)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR2","unstructured":"Biere, A., Fazekas, K., Fleury, M., Heisinger, M.: CaDiCaL, Kissat, Paracooba, Plingeling and Treengeling entering the SAT Competition 2020. In: Balyo, T., Froleyks, N., Heule, M., Iser, M., J\u00e4rvisalo, M., Suda, M. (eds.) Proc. of SAT Competition 2020 - Solver and Benchmark Descriptions. Department of Computer Science Report Series B, vol. B-2020-1, pp. 51\u201353. University of Helsinki (2020)"},{"key":"2_CR3","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-030-51074-9_4","volume-title":"Automated Reasoning","author":"J Brakensiek","year":"2020","unstructured":"Brakensiek, J., Heule, M., Mackey, J., Narv\u00e1ez, D.: The resolution of keller\u2019s conjecture. In: Peltier, N., Sofronie-Stokkermans, V. (eds.) Automated Reasoning, pp. 48\u201365. Springer International Publishing, Cham (2020)"},{"key":"2_CR4","unstructured":"Buss, S., Thapen, N.: DRAT and propagation redundancy proofs without new variables. Log. Methods Comput. Sci. 17(2) (2021), https:\/\/lmcs.episciences.org\/7400"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the Third Annual ACM Symposium on Theory of Computing. pp. 151\u2013158. STOC \u201971, ACM, New York, NY, USA (1971)","DOI":"10.1145\/800157.805047"},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Dantchev, S.S., Riis, S.: \"Planar\" tautologies hard for resolution. In: Proc. of the 42nd Annual Symposium on Foundations of Computer Science (FOCS 2001). pp. 220\u2013229. IEEE Computer Society (2001)","DOI":"10.1109\/SFCS.2001.959896"},{"key":"2_CR7","volume-title":"Ramsey Theory","author":"RL Graham","year":"1990","unstructured":"Graham, R.L., Rothschild, B.L., Spencer, J.H.: Ramsey Theory. A Wiley-Interscience publication, Wiley (1990)"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4153\/CJM-1955-001-4","volume":"7","author":"RE Greenwood","year":"1955","unstructured":"Greenwood, R.E., Gleason, A.M.: Combinatorial relations and chromatic graphs. Can. J. Math. 7, 1\u20137 (1955)","journal-title":"Can. J. Math."},{"issue":"1","key":"2_CR9","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0095-8956(82)90055-7","volume":"33","author":"CM Grinstead","year":"1982","unstructured":"Grinstead, C.M., Roberts, S.M.: On the Ramsey numbers r(3, 8) and r(3, 9). Journal of Combinatorial Theory, Series B 33(1), 27\u201351 (1982)","journal-title":"Journal of Combinatorial Theory, Series B"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0304-3975(85)90144-6","volume":"39","author":"A Haken","year":"1985","unstructured":"Haken, A.: The intractability of resolution. Theoret. Comput. Sci. 39, 297\u2013308 (1985)","journal-title":"Theoret. Comput. Sci."},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/978-3-319-21401-6_40","volume-title":"Automated Deduction - CADE-25","author":"MJH Heule","year":"2015","unstructured":"Heule, M.J.H., Hunt, W.A., Wetzler, N.: Expressing symmetry breaking in drat proofs. In: Felty, A.P., Middeldorp, A. (eds.) Automated Deduction - CADE-25, pp. 591\u2013606. Springer International Publishing, Cham (2015)"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Heule, M.J.H., Kiesl, B., Biere, A.: Short proofs without new variables. In: Proc. of the 26th Int. Conference on Automated Deduction (CADE-26). LNCS, vol. 10395, pp. 130\u2013147. Springer (2017)","DOI":"10.1007\/978-3-319-63046-5_9"},{"issue":"3","key":"2_CR13","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. J. Autom. Reason. 64(3), 533\u2013554 (2020)","journal-title":"J. Autom. Reason."},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Heule, M.J.H., Kiesl, B., Seidl, M., Biere, A.: PRuning through satisfaction. In: In Haifa Verification Conference - HVC. LNCS, vol. 10629, pp. 179\u2013194. Springer (2017)","DOI":"10.1007\/978-3-319-70389-3_12"},{"key":"2_CR15","doi-asserted-by":"publisher","unstructured":"Heule, M.J.H., Kiesl, B., Seidl, M., Biere, A.: PRuning through satisfaction. In: Proc. of the 13th Haifa Verification Conference (HVC 2017). LNCS, vol. 10629, pp. 179\u2013194. Springer (2017). https:\/\/doi.org\/10.1007\/978-3-319-70389-3_12","DOI":"10.1007\/978-3-319-70389-3_12"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Heule, M.J.H., Kullmann, O., Marek, V.W.: Solving and verifying the Boolean Pythagorean Triples problem via Cube-and-Conquer. In: Proceedings SAT 2016. LNCS, vol. 9710, pp. 228\u2013245. Springer (2016)","DOI":"10.1007\/978-3-319-40970-2_15"},{"key":"2_CR17","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/026","volume-title":"Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11\u201313, 1993","author":"DJ Johnson","year":"1996","unstructured":"Johnson, D.J., Trick, M.A.: Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11\u201313, 1993. American Mathematical Society, USA (1996)"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Kiesl, B., Seidl, M., Tompits, H., Biere, A.: Super-blocked clauses. In: Proc. of the 8th Int. Joint Conference on Automated Reasoning (IJCAR 2016). LNCS, vol. 9706, pp. 45\u201361. Springer, Cham (2016)","DOI":"10.1007\/978-3-319-40229-1_5"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Konev, B., Lisitsa, A.: A sat attack on the erdos discrepancy conjecture. In: Sinz, C., Egly, U. (eds.) Theory and Applications of Satisfiability Testing \u2013 SAT 2014, Lecture Notes in Computer Science, vol. 8561, pp. 219\u2013226. Springer International Publishing (2014)","DOI":"10.1007\/978-3-319-09284-3_17"},{"key":"2_CR20","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. Discret. Appl. Math. 96\u201397, 149\u2013176 (1999)","journal-title":"Discret. Appl. Math."},{"key":"2_CR21","unstructured":"Marques-Silva, J., Lynce, I., Malik, S.: Conflict-driven clause learning sat solvers. In: Handbook of Satisfiability, pp. 131\u2013153. IOS Press (2009)"},{"key":"2_CR22","unstructured":"McCarthy, J.: A tough nut for proof procedures. Stanford Artifical Intelligence Project Memo 16 (1964)"},{"key":"2_CR23","unstructured":"McCarthy, J.: A tough nut for proof procedures. Memo 16, Stanford Artificial Intelligence Project (July 1964)"},{"issue":"3","key":"2_CR24","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1002\/jgt.3190190304","volume":"19","author":"BD McKay","year":"1995","unstructured":"McKay, B.D., Radziszowski, S.P.: R(4, 5) = 25. Journal of Graph Theory 19(3), 309\u2013322 (1995)","journal-title":"Journal of Graph Theory"},{"key":"2_CR25","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.) Theory and Applications of Satisfiability Testing - SAT 2009, pp. 223\u2013236. Springer, Berlin Heidelberg, Berlin, Heidelberg (2009)"},{"issue":"1","key":"2_CR26","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/7531.8928","volume":"34","author":"A Urquhart","year":"1987","unstructured":"Urquhart, A.: Hard examples for resolution. J. ACM 34(1), 209\u2013219 (1987)","journal-title":"J. ACM"},{"key":"2_CR27","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/978-3-030-51825-7_15","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2020","author":"E Yolcu","year":"2020","unstructured":"Yolcu, E., Wu, X., Heule, M.J.H.: Mycielski graphs and pr proofs. In: Pulina, L., Seidl, M. (eds.) Theory and Applications of Satisfiability Testing - SAT 2020, pp. 201\u2013217. Springer International Publishing, Cham (2020)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computing \u2013 ICTAC 2023"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47963-2_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,22]],"date-time":"2023-11-22T21:42:01Z","timestamp":1700689321000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47963-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031479625","9783031479632"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47963-2_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTAC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Colloquium on Theoretical Aspects of Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lima","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Peru","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ictac2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ictac2023.compsust.utec.edu.pe\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}