{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:50:33Z","timestamp":1762102233909,"version":"3.41.0"},"publisher-location":"Cham","reference-count":53,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319941431"},{"type":"electronic","value":"9783319941448"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/2.zoppoz.workers.dev:443\/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-94144-8_18","type":"book-chapter","created":{"date-parts":[[2018,6,25]],"date-time":"2018-06-25T08:36:02Z","timestamp":1529915762000},"page":"292-310","update-policy":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["In Between Resolution and Cutting Planes: A Study of Proof Systems for Pseudo-Boolean SAT Solving"],"prefix":"10.1007","author":[{"given":"Marc","family":"Vinyals","sequence":"first","affiliation":[]},{"given":"Jan","family":"Elffers","sequence":"additional","affiliation":[]},{"given":"Jes\u00fas","family":"Gir\u00e1ldez-Cru","sequence":"additional","affiliation":[]},{"given":"Stephan","family":"Gocht","sequence":"additional","affiliation":[]},{"given":"Jakob","family":"Nordstr\u00f6m","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,26]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Alekhnovich, M., Johannsen, J., Pitassi, T., Urquhart, A.: An exponential separation between regular and general resolution. Theory Comput. 3(5), 81\u2013102 (2007). preliminary version in STOC 2002","DOI":"10.4086\/toc.2007.v003a005"},{"issue":"4","key":"18_CR2","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1137\/06066850X","volume":"38","author":"Michael Alekhnovich","year":"2008","unstructured":"Alekhnovich, M., Razborov, A.A.: Resolution is not automatizable unless W[P] is tractable. SIAM J. Comput. 38(4), 1347\u20131363 (2008). Preliminary version in FOCS 2001","journal-title":"SIAM Journal on Computing"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Atserias, A., Fichte, J.K., Thurley, M.: Clause-learning algorithms with many restarts and bounded-width resolution. J. Artif. Intell. Res. 40, 353\u2013373 (2011). Preliminary version in SAT 2009","DOI":"10.1613\/jair.3152"},{"key":"18_CR4","unstructured":"Bayardo Jr., R.J., Schrag, R.: Using CSP look-back techniques to solve real-world SAT instances. In: Proceedings of the 14th National Conference on Artificial Intelligence (AAAI 1997), pp. 203\u2013208, July 1997"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Beame, P., Kautz, H., Sabharwal, A.: Towards understanding and harnessing the potential of clause learning. J. Artif. Intell. Res. 22, 319\u2013351 (2004). Preliminary version in IJCAI 2003","DOI":"10.1613\/jair.1410"},{"issue":"4","key":"18_CR6","doi-asserted-by":"publisher","first-page":"585","DOI":"10.1007\/s00493-004-0036-5","volume":"24","author":"E Ben-Sasson","year":"2004","unstructured":"Ben-Sasson, E., Impagliazzo, R., Wigderson, A.: Near optimal separation of tree-like and general resolution. Combinatorica 24(4), 585\u2013603 (2004)","journal-title":"Combinatorica"},{"key":"18_CR7","unstructured":"Blake, A.: Canonical Expressions in Boolean Algebra. Ph.D. thesis, University of Chicago (1937)"},{"issue":"03","key":"18_CR8","doi-asserted-by":"publisher","first-page":"708","DOI":"10.2307\/2275569","volume":"62","author":"Maria Bonet","year":"1997","unstructured":"Bonet, M., Pitassi, T., Raz, R.: Lower bounds for cutting planes proofs with small coefficients. J. Symbolic Logic 62(3), 708\u2013728 (1997). Preliminary version in STOC 1995","journal-title":"The Journal of Symbolic Logic"},{"issue":"3","key":"18_CR9","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1109\/TCAD.2004.842808","volume":"24","author":"D Chai","year":"2005","unstructured":"Chai, D., Kuehlmann, A.: A fast pseudo-Boolean constraint solver. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 24(3), 305\u2013317 (2005). Preliminary version in DAC 2003","journal-title":"IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst."},{"issue":"1","key":"18_CR10","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0012-365X(73)90167-2","volume":"4","author":"V Chv\u00e1tal","year":"1973","unstructured":"Chv\u00e1tal, V.: Edmonds polytopes and a hierarchy of combinatorial problems. Discrete Math. 4(1), 305\u2013337 (1973)","journal-title":"Discrete Math."},{"issue":"4","key":"18_CR11","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1145\/48014.48016","volume":"35","author":"V Chv\u00e1tal","year":"1988","unstructured":"Chv\u00e1tal, V., Szemer\u00e9di, E.: Many hard examples for resolution. J. ACM 35(4), 759\u2013768 (1988)","journal-title":"J. ACM"},{"key":"18_CR12","unstructured":"CNFgen: Combinatorial benchmarks for SAT solvers. https:\/\/2.zoppoz.workers.dev:443\/https\/github.com\/MassimoLauria\/cnfgen"},{"key":"18_CR13","doi-asserted-by":"crossref","unstructured":"Cook, S.A.: The complexity of theorem-proving procedures. In: Proceedings of the 3rd Annual ACM Symposium on Theory of Computing (STOC 1971), pp. 151\u2013158 (1971)","DOI":"10.1145\/800157.805047"},{"issue":"1","key":"18_CR14","doi-asserted-by":"publisher","first-page":"36","DOI":"10.2307\/2273702","volume":"44","author":"SA Cook","year":"1979","unstructured":"Cook, S.A., Reckhow, R.: The relative efficiency of propositional proof systems. J. Symbolic Log. 44(1), 36\u201350 (1979)","journal-title":"J. Symbolic Log."},{"issue":"1","key":"18_CR15","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0166-218X(87)90039-4","volume":"18","author":"W Cook","year":"1987","unstructured":"Cook, W., Coullard, C.R., Tur\u00e1n, G.: On the complexity of cutting-plane proofs. Discrete Appl. Math. 18(1), 25\u201338 (1987)","journal-title":"Discrete Appl. Math."},{"issue":"7","key":"18_CR16","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M Davis","year":"1962","unstructured":"Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. Commun. ACM 5(7), 394\u2013397 (1962)","journal-title":"Commun. ACM"},{"issue":"3","key":"18_CR17","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1145\/321033.321034","volume":"7","author":"M Davis","year":"1960","unstructured":"Davis, M., Putnam, H.: A computing procedure for quantification theory. J. ACM 7(3), 201\u2013215 (1960)","journal-title":"J. ACM"},{"key":"18_CR18","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1613\/jair.1656","volume":"23","author":"HE Dixon","year":"2005","unstructured":"Dixon, H.E., Ginsberg, M.L., Hofer, D.K., Luks, E.M., Parkes, A.J.: Generalizing Boolean satisfiability III: implementation. J. Artif. Intell. Res. 23, 441\u2013531 (2005)","journal-title":"J. Artif. Intell. Res."},{"key":"18_CR19","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1613\/jair.1555","volume":"22","author":"HE Dixon","year":"2004","unstructured":"Dixon, H.E., Ginsberg, M.L., Luks, E.M., Parkes, A.J.: Generalizing Boolean satisfiability II: theory. J. Artif. Intell. Res. 22, 481\u2013534 (2004)","journal-title":"J. Artif. Intell. Res."},{"key":"18_CR20","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1023\/B:AIRE.0000036255.53433.26","volume":"21","author":"HE Dixon","year":"2004","unstructured":"Dixon, H.E., Ginsberg, M.L., Parkes, A.J.: Generalizing Boolean satisfiability I: Background and survey of existing work. J. Artif. Intell. Res. 21, 193\u2013243 (2004)","journal-title":"J. Artif. Intell. Res."},{"key":"18_CR21","unstructured":"Elffers, J.: CDCL-cuttingplanes: A conflict-driven pseudo-Boolean solver (2016). Submitted to the Pseudo-Boolean Competition 2016"},{"key":"18_CR22","doi-asserted-by":"crossref","unstructured":"Elffers, J., Gir\u00e1ldez-Cru, J., Nordstr\u00f6m, J., Vinyals, M.: Using combinatorial benchmarks to probe the reasoning power of pseudo-Boolean solvers. In: Proceedings of the 21st International Conference on Theory and Applications of Satisfiability Testing (SAT 2018), July 2018. To appear","DOI":"10.1007\/978-3-319-94144-8_5"},{"key":"18_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/978-3-319-40970-2_11","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2016","author":"J Elffers","year":"2016","unstructured":"Elffers, J., Johannsen, J., Lauria, M., Magnard, T., Nordstr\u00f6m, J., Vinyals, M.: Trade-offs between time and memory in a tighter model of CDCL SAT solvers. In: Creignou, N., Le Berre, D. (eds.) SAT 2016. LNCS, vol. 9710, pp. 160\u2013176. Springer, Cham (2016). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-319-40970-2_11"},{"key":"18_CR24","doi-asserted-by":"crossref","unstructured":"Elffers, J., Nordstr\u00f6m, J.: Divide and conquer: towards faster pseudo-Boolean solving. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence (IJCAI-ECAI 2018), July 2018. To appear","DOI":"10.24963\/ijcai.2018\/180"},{"key":"18_CR25","unstructured":"Filmus, Y., Hrube\u0161, P., Lauria, M.: Semantic versus syntactic cutting planes. In: Proceedings of the 33rd International Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), vol. 47, pp. 35:1\u201335:13, February 2016"},{"key":"18_CR26","doi-asserted-by":"crossref","unstructured":"Fleming, N., Pankratov, D., Pitassi, T., Robere, R.: Random $$\\theta (\\log n)$$-CNFs are hard for cutting planes. In: Proceedings of the 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2017), pp. 109\u2013120, October 2017","DOI":"10.1109\/FOCS.2017.19"},{"key":"18_CR27","doi-asserted-by":"crossref","unstructured":"Goerdt, A.: The cutting plane proof system with bounded degree of falsity. In: Proceedings of the 5th International Workshop on Computer Science Logic (CSL 1991), pp. 119\u2013133, October 1991","DOI":"10.1007\/BFb0023762"},{"key":"18_CR28","first-page":"269","volume-title":"Recent Advances in Mathematical Programming","author":"RE Gomory","year":"1963","unstructured":"Gomory, R.E.: An algorithm for integer solutions of linear programs. In: Graves, R., Wolfe, P. (eds.) Recent Advances in Mathematical Programming, pp. 269\u2013302. McGraw-Hill, New York (1963)"},{"issue":"2\u20133","key":"18_CR29","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(2\u20133), 297\u2013308 (1985)","journal-title":"Theoret. Comput. Sci."},{"key":"18_CR30","doi-asserted-by":"crossref","unstructured":"Hirsch, E.A., Kojevnikov, A., Kulikov, A.S., Nikolenko, S.I.: Complexity of semialgebraic proofs with restricted degree of falsity. J. Satisfiability Boolean Model. Comput. 6, 53\u201369 (2008). Preliminary version in SAT 2005 and SAT 2006","DOI":"10.3233\/SAT190062"},{"issue":"1","key":"18_CR31","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF02186368","volume":"12","author":"JN Hooker","year":"1988","unstructured":"Hooker, J.N.: Generalized resolution and cutting planes. Ann. Oper. Res. 12(1), 217\u2013239 (1988)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"18_CR32","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BF01531033","volume":"6","author":"JN Hooker","year":"1992","unstructured":"Hooker, J.N.: Generalized resolution for $$0$$-$$1$$ linear inequalities. Ann. Math. Artif. Intell. 6(1), 271\u2013286 (1992)","journal-title":"Ann. Math. Artif. Intell."},{"key":"18_CR33","doi-asserted-by":"crossref","unstructured":"Hrube\u0161, P., Pudl\u00e1k, P.: Random formulas, monotone circuits, and interpolation. In: Proceedings of the 58th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2017), pp. 121\u2013131, October 2017","DOI":"10.1109\/FOCS.2017.20"},{"key":"18_CR34","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Pitassi, T., Urquhart, A.: Upper and lower bounds for tree-like cutting planes proofs. In: Proceedings of the 9th Annual IEEE Symposium on Logic in Computer Science (LICS 1994). pp. 220\u2013228, July 1994","DOI":"10.1109\/LICS.1994.316069"},{"key":"18_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1007\/978-3-319-66263-3_30","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2017","author":"M Lauria","year":"2017","unstructured":"Lauria, M., Elffers, J., Nordstr\u00f6m, J., Vinyals, M.: CNFgen: a generator of crafted benchmarks. In: Gaspers, S., Walsh, T. (eds.) SAT 2017. LNCS, vol. 10491, pp. 464\u2013473. Springer, Cham (2017). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-319-66263-3_30"},{"key":"18_CR36","doi-asserted-by":"crossref","first-page":"59","DOI":"10.3233\/SAT190075","volume":"7","author":"D Le Berre","year":"2010","unstructured":"Le Berre, D., Parrain, A.: The SAT4J library, release 2.2. J. Satisfiability Boolean Model. Comput. 7, 59\u201364 (2010)","journal-title":"J. Satisfiability Boolean Model. Comput."},{"issue":"1\u20134","key":"18_CR37","doi-asserted-by":"crossref","first-page":"221","DOI":"10.3233\/SAT190024","volume":"2","author":"K Markstr\u00f6m","year":"2006","unstructured":"Markstr\u00f6m, K.: Locality and hard SAT-instances. J. Satisfiability Boolean Model. Comput. 2(1\u20134), 221\u2013227 (2006)","journal-title":"J. Satisfiability Boolean Model. Comput."},{"issue":"5","key":"18_CR38","doi-asserted-by":"publisher","first-page":"506","DOI":"10.1109\/12.769433","volume":"48","author":"J.P. Marques-Silva","year":"1999","unstructured":"Marques-Silva, J.P., Sakallah, K.A.: GRASP: A search algorithm for propositional satisfiability. IEEE Trans. Comput. 48(5), 506\u2013521 (1999). Preliminary version in ICCAD 1996","journal-title":"IEEE Transactions on Computers"},{"key":"18_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-319-09284-3_10","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2014","author":"M Mik\u0161a","year":"2014","unstructured":"Mik\u0161a, M., Nordstr\u00f6m, J.: Long proofs of (seemingly) simple formulas. In: Sinz, C., Egly, U. (eds.) SAT 2014. LNCS, vol. 8561, pp. 121\u2013137. Springer, Cham (2014). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-319-09284-3_10"},{"key":"18_CR40","doi-asserted-by":"crossref","unstructured":"Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proceedings of the 38th Design Automation Conference (DAC 2001), pp. 530\u2013535, June 2001","DOI":"10.1145\/378239.379017"},{"key":"18_CR41","doi-asserted-by":"crossref","unstructured":"Nordstr\u00f6m, J.: Pebble games, proof complexity and time-space trade-offs. Log. Methods Comput. Sci. 9(3), 15:1\u201315:63 (2013)","DOI":"10.2168\/LMCS-9(3:15)2013"},{"issue":"3","key":"18_CR42","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/2815493.2815497","volume":"2","author":"J Nordstr\u00f6m","year":"2015","unstructured":"Nordstr\u00f6m, J.: On the interplay between proof complexity and SAT solving. ACM SIGLOG News 2(3), 19\u201344 (2015)","journal-title":"ACM SIGLOG News"},{"issue":"2","key":"18_CR43","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1016\/j.artint.2010.10.002","volume":"175","author":"Knot Pipatsrisawat","year":"2011","unstructured":"Pipatsrisawat, K., Darwiche, A.: On the power of clause-learning SAT solvers as resolution engines. Artif. Intell. 175(2), 512\u2013525, February 2011. Preliminary version in CP 2009","journal-title":"Artificial Intelligence"},{"key":"18_CR44","unstructured":"Pseudo-Boolean competition 2016. https:\/\/2.zoppoz.workers.dev:443\/http\/www.cril.univ-artois.fr\/PB16\/, July 2016"},{"issue":"3","key":"18_CR45","doi-asserted-by":"publisher","first-page":"981","DOI":"10.2307\/2275583","volume":"62","author":"P Pudl\u00e1k","year":"1997","unstructured":"Pudl\u00e1k, P.: Lower bounds for resolution and cutting plane proofs and monotone computations. J. Symbol. Log. 62(3), 981\u2013998 (1997)","journal-title":"J. Symbol. Log."},{"issue":"1","key":"18_CR46","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"JA Robinson","year":"1965","unstructured":"Robinson, J.A.: A machine-oriented logic based on the resolution principle. J. ACM 12(1), 23\u201341 (1965)","journal-title":"J. ACM"},{"key":"18_CR47","unstructured":"Roussel, O., Manquinho, V.M.: Pseudo-Boolean and cardinality constraints. In: Biere, A., Heule, M.J.H., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185, chap. 22, pp. 695\u2013733. IOS Press, February 2009"},{"key":"18_CR48","unstructured":"SAT4J: The Boolean satisfaction and optimization library in Java. https:\/\/2.zoppoz.workers.dev:443\/http\/www.sat4j.org\/"},{"key":"18_CR49","doi-asserted-by":"crossref","unstructured":"Sheini, H.M., Sakallah, K.A.: Pueblo: A hybrid pseudo-Boolean SAT solver. J. Satisfiability Boolean Model. Comput. 2(1\u20134), 165\u2013189, March 2006. Preliminary version in DATE 2005","DOI":"10.3233\/SAT190020"},{"key":"18_CR50","doi-asserted-by":"publisher","first-page":"1.1","DOI":"10.1145\/1671970.1671972","volume":"15","author":"Ivor Spence","year":"2010","unstructured":"Spence, I.: sgen1: A generator of small but difficult satisfiability benchmarks. J. Exp. Algorithmics 15, 1.2:1\u20131.2:15, March 2010","journal-title":"Journal of Experimental Algorithmics"},{"issue":"1","key":"18_CR51","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"},{"issue":"1","key":"18_CR52","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1137\/090772897","volume":"40","author":"Alasdair Urquhart","year":"2011","unstructured":"Urquhart, A.: A near-optimal separation of regular and general resolution. SIAM J. Comput. 40(1), 107\u2013121 (2011). Preliminary version in SAT 2008","journal-title":"SIAM Journal on Computing"},{"key":"18_CR53","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"388","DOI":"10.1007\/978-3-642-14186-7_37","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2010","author":"A Van Gelder","year":"2010","unstructured":"Van Gelder, A., Spence, I.: Zero-one designs produce small hard SAT instances. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol. 6175, pp. 388\u2013397. Springer, Heidelberg (2010). https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-642-14186-7_37"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Satisfiability Testing \u2013 SAT 2018"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-94144-8_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T08:45:47Z","timestamp":1751705147000},"score":1,"resource":{"primary":{"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/link.springer.com\/10.1007\/978-3-319-94144-8_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319941431","9783319941448"],"references-count":53,"URL":"https:\/\/2.zoppoz.workers.dev:443\/https\/doi.org\/10.1007\/978-3-319-94144-8_18","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":"26 June 2018","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":"Oxford","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","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":"9 July 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 July 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sat2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2.zoppoz.workers.dev:443\/http\/sat2018.azurewebsites.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Open","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":"58","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":"20","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":"4","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":"34% - 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":"4","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":"7","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":"2 tool papers were accepted","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)"}}]}}