{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T17:08:55Z","timestamp":1742922535679,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030242572"},{"type":"electronic","value":"9783030242589"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-24258-9_1","type":"book-chapter","created":{"date-parts":[[2019,6,28]],"date-time":"2019-06-28T21:02:31Z","timestamp":1561755751000},"page":"1-18","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Circular (Yet Sound) Proofs"],"prefix":"10.1007","author":[{"given":"Albert","family":"Atserias","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Massimo","family":"Lauria","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,29]]},"reference":[{"key":"1_CR1","unstructured":"Atserias, A., Hakoniemi, T.: Size-degree trade-offs for sums-of-squares and Positivstellensatz proofs. To appear in Proceedings of 34th Annual Conference on Computational Complexity (CCC 2019) (2019). Long version in arXiv:1811.01351 [cs.CC] 2018"},{"key":"1_CR2","unstructured":"Atserias, A., Lauria, M.: Circular (yet sound) proofs. CoRR, abs\/1802.05266 (2018)"},{"issue":"3","key":"1_CR3","doi-asserted-by":"publisher","first-page":"19:1","DOI":"10.1145\/2898435","volume":"17","author":"A Atserias","year":"2016","unstructured":"Atserias, A., Lauria, M., Nordstr\u00f6m, J.: Narrow proofs may be maximally long. ACM Trans. Comput. Log. 17(3), 19:1\u201319:30 (2016)","journal-title":"ACM Trans. Comput. Log."},{"issue":"1","key":"1_CR4","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/130950173","volume":"30","author":"YH Au","year":"2016","unstructured":"Au, Y.H., Tun\u00e7el, L.: A comprehensive analysis of polyhedral lift-and-project methods. SIAM J. Discrete Math. 30(1), 411\u2013451 (2016)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"1_CR5","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1145\/375827.375835","volume":"48","author":"E Ben-Sasson","year":"2001","unstructured":"Ben-Sasson, E., Wigderson, A.: Short proofs are narrow - resolution made simple. J. ACM 48(2), 149\u2013169 (2001)","journal-title":"J. ACM"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Bonet, M.L., Buss, S., Ignatiev, A., Marques-Silva, J., Morgado, A.: MaxSAT resolution with the dual rail encoding. In: Proceedings of the 32nd AAAI Conference on Artificial Intelligence (2018)","DOI":"10.1609\/aaai.v32i1.12204"},{"issue":"5","key":"1_CR7","doi-asserted-by":"publisher","first-page":"1462","DOI":"10.1137\/S0097539799352474","volume":"30","author":"ML Bonet","year":"2000","unstructured":"Bonet, M.L., Esteban, J.L., Galesi, N., Johannsen, J.: On the relative complexity of resolution refinements and cutting planes proof systems. SIAM J. Comput. 30(5), 1462\u20131484 (2000)","journal-title":"SIAM J. Comput."},{"key":"1_CR8","unstructured":"Brotherston, J.: Sequent calculus proof systems for inductive definitions. Ph.D. thesis, University of Edinburgh, November 2006"},{"issue":"6","key":"1_CR9","doi-asserted-by":"publisher","first-page":"1177","DOI":"10.1093\/logcom\/exq052","volume":"21","author":"J Brotherston","year":"2011","unstructured":"Brotherston, J., Simpson, A.: Sequent calculi for induction and infinite descent. J. Log. Comput. 21(6), 1177\u20131216 (2011)","journal-title":"J. Log. Comput."},{"issue":"4","key":"1_CR10","doi-asserted-by":"publisher","first-page":"916","DOI":"10.2307\/2273826","volume":"52","author":"SR Buss","year":"1987","unstructured":"Buss, S.R.: Polynomial size proofs of the propositional pigeonhole principle. J. Symb. Log. 52(4), 916\u2013927 (1987)","journal-title":"J. Symb. Log."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Dantchev, S.S.: Rank complexity gap for Lov\u00e1sz-Schrijver and Sherali-Adams proof systems. In: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, pp. 311\u2013317 (2007)","DOI":"10.1145\/1250790.1250837"},{"issue":"21\u201323","key":"1_CR12","doi-asserted-by":"publisher","first-page":"2054","DOI":"10.1016\/j.tcs.2009.01.002","volume":"410","author":"SS Dantchev","year":"2009","unstructured":"Dantchev, S.S., Martin, B., Rhodes, M.N.C.: Tight rank lower bounds for the Sherali-Adams proof system. Theor. Comput. Sci. 410(21\u201323), 2054\u20132063 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/11944836_26","volume-title":"FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science","author":"C Dax","year":"2006","unstructured":"Dax, C., Hofmann, M., Lange, M.: A proof system for the linear time $${\\mu }$$ -calculus. In: Arun-Kumar, S., Garg, N. (eds.) FSTTCS 2006. LNCS, vol. 4337, pp. 273\u2013284. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11944836_26"},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/3-540-54487-9_59","volume-title":"Computer Science Logic","author":"A Goerdt","year":"1991","unstructured":"Goerdt, A.: Cutting plane versus frege proof systems. In: B\u00f6rger, E., Kleine B\u00fcning, H., Richter, M.M., Sch\u00f6nfeld, W. (eds.) CSL 1990. LNCS, vol. 533, pp. 174\u2013194. Springer, Heidelberg (1991). https:\/\/doi.org\/10.1007\/3-540-54487-9_59"},{"issue":"1","key":"1_CR15","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1016\/S0304-3975(00)00157-2","volume":"259","author":"D Grigoriev","year":"2001","unstructured":"Grigoriev, D.: Linear lower bound on degrees of positivstellensatz calculus proofs for the parity. Theor. Comput. Sci. 259(1), 613\u2013622 (2001)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR16","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. Theor. Comp. Sci. 39, 297\u2013308 (1985)","journal-title":"Theor. Comp. Sci."},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-319-66263-3_11","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2017","author":"A Ignatiev","year":"2017","unstructured":"Ignatiev, A., Morgado, A., Marques-Silva, J.: On tackling the limits of resolution in SAT solving. In: Gaspers, S., Walsh, T. (eds.) SAT 2017. LNCS, vol. 10491, pp. 164\u2013183. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66263-3_11"},{"key":"1_CR18","volume-title":"Bounded Arithmetic, Propositional Logic and Complexity Theory","author":"J Kraj\u00ed\u010dek","year":"1994","unstructured":"Kraj\u00ed\u010dek, J.: Bounded Arithmetic, Propositional Logic and Complexity Theory. Cambridge University Press, Cambridge (1994)"},{"issue":"1","key":"1_CR19","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0304-3975(95)00136-0","volume":"163","author":"D Niwi\u0144ski","year":"1996","unstructured":"Niwi\u0144ski, D., Walukiewicz, I.: Games for the $$\\mu $$ -calculus. Theor. Comp. Sci. 163(1), 99\u2013116 (1996)","journal-title":"Theor. Comp. Sci."},{"issue":"1","key":"1_CR20","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1137\/100816833","volume":"41","author":"T Pitassi","year":"2012","unstructured":"Pitassi, T., Segerlind, N.: Exponential lower bounds and integrality gaps for tree-like Lov\u00e1sz-Schrijver procedures. SIAM J. Comput. 41(1), 128\u2013159 (2012)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"1_CR21","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1137\/0403036","volume":"3","author":"HD Sherali","year":"1990","unstructured":"Sherali, H.D., Adams, W.P.: A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems. SIAM J. Disc. Math. 3(3), 411\u2013430 (1990)","journal-title":"SIAM J. Disc. Math."},{"key":"1_CR22","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511565687","volume-title":"Multiple-Conclusion Logic","author":"J Shoesmith","year":"1978","unstructured":"Shoesmith, J., Smiley, T.J.: Multiple-Conclusion Logic. Cambridge University Press, Cambridge (1978)"},{"issue":"3","key":"1_CR23","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s11225-008-9133-6","volume":"89","author":"T Studer","year":"2008","unstructured":"Studer, T.: On the proof theory of the modal mu-calculus. Studia Logica 89(3), 343\u2013363 (2008)","journal-title":"Studia Logica"},{"key":"1_CR24","unstructured":"Vinyals, M.: Personal communication (2018)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2019"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-24258-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,22]],"date-time":"2022-09-22T10:31:42Z","timestamp":1663842702000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-24258-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030242572","9783030242589"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-24258-9_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"29 June 2019","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":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sat2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sat2019.tecnico.ulisboa.pt\/","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":"64","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":"19","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":"7","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":"30% - 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)"}}]}}