{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T22:45:36Z","timestamp":1774046736170,"version":"3.50.1"},"publisher-location":"Cham","reference-count":55,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319983332","type":"print"},{"value":"9783319983349","type":"electronic"}],"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_19","type":"book-chapter","created":{"date-parts":[[2018,8,22]],"date-time":"2018-08-22T12:33:14Z","timestamp":1534941194000},"page":"276-294","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":17,"title":["Evaluating QBF Solvers: Quantifier Alternations Matter"],"prefix":"10.1007","author":[{"given":"Florian","family":"Lonsing","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uwe","family":"Egly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,23]]},"reference":[{"key":"19_CR1","unstructured":"Atserias, A., Oliva, S.: Bounded-width QBF is PSPACE-complete. In: STACS. LIPIcs, vol. 20, pp. 44\u201354. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2013)"},{"key":"19_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/3-540-36126-X_12","volume-title":"Formal Methods in Computer-Aided Design","author":"A Ayari","year":"2002","unstructured":"Ayari, A., Basin, D.: Qubos: deciding quantified boolean logic using propositional satisfiability solvers. In: Aagaard, M.D., O\u2019Leary, J.W. (eds.) FMCAD 2002. LNCS, vol. 2517, pp. 187\u2013201. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36126-X_12"},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.artint.2015.01.002","volume":"223","author":"A Balint","year":"2015","unstructured":"Balint, A., Belov, A., J\u00e4rvisalo, M., Sinz, C.: Overview and analysis of the SAT challenge 2012 solver competition. Artif. Intell. 223, 120\u2013155 (2015)","journal-title":"Artif. Intell."},{"key":"19_CR4","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.artint.2016.08.007","volume":"241","author":"T Balyo","year":"2016","unstructured":"Balyo, T., Biere, A., Iser, M., Sinz, C.: SAT race 2015. Artif. Intell. 241, 45\u201365 (2016). https:\/\/doi.org\/10.1016\/j.artint.2016.08.007","journal-title":"Artif. Intell."},{"key":"19_CR5","doi-asserted-by":"crossref","unstructured":"Balyo, T., Heule, M.J.H., J\u00e4rvisalo, M.: SAT competition 2016: recent developments. In: AAAI, pp. 5061\u20135063. AAAI Press (2017)","DOI":"10.1609\/aaai.v31i1.10641"},{"key":"19_CR6","doi-asserted-by":"crossref","unstructured":"Beyersdorff, O., Blinkhorn, J., Hinde, L.: Size, cost and capacity: a semantic technique for hard random QBFs. In: ITCS. LIPIcs, vol. 94, pp. 9:1\u20139:18. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2018)","DOI":"10.23638\/LMCS-15(1:13)2019"},{"key":"19_CR7","unstructured":"Beyersdorff, O., Chew, L., Janota, M.: Proof complexity of resolution-based QBF calculi. In: STACS. LIPIcs, vol. 30, pp. 76\u201389. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015)"},{"key":"19_CR8","unstructured":"Beyersdorff, O., Chew, L., Janota, M.: Extension variables in QBF Resolution. In: Beyond NP Workshop, AAAI Workshops, vol. WS-16-05. AAAI Press (2016)"},{"key":"19_CR9","unstructured":"Beyersdorff, O., Hinde, L., Pich, J.: Reasons for hardness in QBF proof systems. In: FSTTCS. LIPIcs, vol. 93, pp. 14:1\u201314:15. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/11527695_5","volume-title":"Theory and Applications of Satisfiability Testing","author":"A Biere","year":"2005","unstructured":"Biere, A.: Resolve and expand. In: Hoos, H.H., Mitchell, D.G. (eds.) SAT 2004. LNCS, vol. 3542, pp. 59\u201370. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11527695_5"},{"key":"19_CR11","unstructured":"Bogaerts, B., Janhunen, T., Tasharrofi, S.: SAT-to-SAT in QBFEval 2016. In: QBF Workshop, CEUR Workshop Proceedings, vol. 1719, pp. 63\u201370. CEUR-WS.org (2016)"},{"key":"19_CR12","unstructured":"Bogaerts, B., Janhunen, T., Tasharrofi, S.: Solving QBF instances with nested SAT solvers. In: Beyond NP Workshop 2016 at AAAI 2016 (2016)"},{"key":"19_CR13","unstructured":"Bordeaux, L., Cadoli, M., Mancini, T.: CSP properties for quantified constraints: definitions and complexity. In: AAAI, pp. 360\u2013365. AAAI Press\/The MIT Press (2005)"},{"key":"19_CR14","unstructured":"Cadoli, M., Giovanardi, A., Schaerf, M.: An algorithm to evaluate quantified Boolean formulae. In: AAAI, pp. 262\u2013267. AAAI Press\/The MIT Press (1998)"},{"key":"19_CR15","unstructured":"Charwat, G., Woltran, S.: Expansion-based QBF solving on tree decompositions. In: RCRA Workshop, CEUR Workshop Proceedings, vol. 2011, pp. 16\u201326. CEUR-WS.org (2017)"},{"issue":"1","key":"19_CR16","doi-asserted-by":"publisher","first-page":"2:1","DOI":"10.1145\/1592451.1592453","volume":"42","author":"H Chen","year":"2009","unstructured":"Chen, H.: A rendezvous of logic, complexity, and algebra. ACM Comput. Surv. 42(1), 2:1\u20132:32 (2009)","journal-title":"ACM Comput. Surv."},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-642-29485-3_4","volume-title":"Logic and Program Semantics","author":"H Chen","year":"2012","unstructured":"Chen, H.: Meditations on quantified constraint satisfaction. In: Constable, R.L., Silva, A. (eds.) Logic and Program Semantics. LNCS, vol. 7230, pp. 35\u201349. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29485-3_4"},{"issue":"3","key":"19_CR18","first-page":"15:1","volume":"9","author":"H Chen","year":"2017","unstructured":"Chen, H.: Proof complexity modulo the polynomial hierarchy: understanding alternation as a source of hardness. TOCT 9(3), 15:1\u201315:20 (2017)","journal-title":"TOCT"},{"issue":"5","key":"19_CR19","doi-asserted-by":"publisher","first-page":"752","DOI":"10.1145\/876638.876643","volume":"50","author":"EM Clarke","year":"2003","unstructured":"Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement for symbolic model checking. J. ACM 50(5), 752\u2013794 (2003)","journal-title":"J. ACM"},{"issue":"1","key":"19_CR20","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. J. Symb. Log. 44(1), 36\u201350 (1979)","journal-title":"J. Symb. Log."},{"issue":"7","key":"19_CR21","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.W.: A machine program for theorem-proving. Commun. ACM 5(7), 394\u2013397 (1962)","journal-title":"Commun. ACM"},{"key":"19_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1007\/978-3-540-24605-3_17","volume-title":"Theory and Applications of Satisfiability Testing","author":"U Egly","year":"2004","unstructured":"Egly, U., Seidl, M., Tompits, H., Woltran, S., Zolda, M.: Comparing different prenexing strategies for quantified Boolean formulas. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 214\u2013228. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24605-3_17"},{"key":"19_CR23","unstructured":"Giunchiglia, E., Narizzano, M., Pulina, L., Tacchella, A.: Quantified Boolean Formulas Library (QBFLIB) and Solver Evaluation Portal (QBFEVAL) (2004). www.qbflib.org"},{"key":"19_CR24","unstructured":"Giunchiglia, E., Narizzano, M., Tacchella, A.: Learning for quantified boolean logic satisfiability. In: AAAI, pp. 649\u2013654. AAAI Press\/The MIT Press (2002)"},{"key":"19_CR25","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1613\/jair.1959","volume":"26","author":"E Giunchiglia","year":"2006","unstructured":"Giunchiglia, E., Narizzano, M., Tacchella, A.: Clause\/term resolution and learning in the evaluation of quantified Boolean formulas. JAIR 26, 371\u2013416 (2006)","journal-title":"JAIR"},{"key":"19_CR26","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1613\/jair.4694","volume":"53","author":"M Heule","year":"2015","unstructured":"Heule, M., J\u00e4rvisalo, M., Lonsing, F., Seidl, M., Biere, A.: Clause elimination for SAT and QSAT. JAIR 53, 127\u2013168 (2015)","journal-title":"JAIR"},{"issue":"1","key":"19_CR27","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/BF02430364","volume":"1","author":"JN Hooker","year":"1995","unstructured":"Hooker, J.N.: Testing heuristics: we have it all wrong. J. Heuristics 1(1), 33\u201342 (1995)","journal-title":"J. Heuristics"},{"key":"19_CR28","doi-asserted-by":"crossref","unstructured":"Janota, M.: Towards generalization in QBF solving via machine learning. In: Proceedings of the AAAI 2018 (2018, to appear)","DOI":"10.1609\/aaai.v32i1.12208"},{"key":"19_CR29","first-page":"187","volume":"9","author":"M Janota","year":"2016","unstructured":"Janota, M., Jordan, C., Klieber, W., Lonsing, F., Seidl, M., Van Gelder, A.: The QBFGallery 2014: the QBF competition at the FLoC olympic games. JSAT 9, 187\u2013206 (2016)","journal-title":"JSAT"},{"key":"19_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2016.01.004","volume":"234","author":"M Janota","year":"2016","unstructured":"Janota, M., Klieber, W., Marques-Silva, J., Clarke, E.: Solving QBF with counterexample guided refinement. Artif. Intell. 234, 1\u201325 (2016)","journal-title":"Artif. Intell."},{"key":"19_CR31","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2015.01.048","volume":"577","author":"M Janota","year":"2015","unstructured":"Janota, M., Marques-Silva, J.: Expansion-based QBF solving versus Q-resolution. Theor. Comput. Sci. 577, 25\u201342 (2015)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR32","unstructured":"Janota, M., Marques-Silva, J.: Solving QBF by clause selection. In: IJCAI, pp. 325\u2013331. AAAI Press (2015)"},{"key":"19_CR33","unstructured":"Kleine B\u00fcning, H., Bubeck, U.: Theory of quantified Boolean formulas. In: Handbook of Satisfiability, FAIA, vol. 185, pp. 735\u2013760. IOS Press (2009)"},{"issue":"1","key":"19_CR34","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1006\/inco.1995.1025","volume":"117","author":"H Kleine B\u00fcning","year":"1995","unstructured":"Kleine B\u00fcning, H., Karpinski, M., Fl\u00f6gel, A.: Resolution for quantified Boolean formulas. Inf. Comput. 117(1), 12\u201318 (1995)","journal-title":"Inf. Comput."},{"key":"19_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/978-3-642-14186-7_12","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2010","author":"W Klieber","year":"2010","unstructured":"Klieber, W., Sapra, S., Gao, S., Clarke, E.: A non-prenex, non-clausal QBF solver with game-state learning. In: Strichman, O., Szeider, S. (eds.) SAT 2010. LNCS, vol. 6175, pp. 128\u2013142. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14186-7_12"},{"key":"19_CR36","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/3-540-45616-3_12","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"R Letz","year":"2002","unstructured":"Letz, R.: Lemma and model caching in decision procedures for quantified Boolean formulas. In: Egly, U., Ferm\u00fcller, C.G. (eds.) TABLEAUX 2002. LNCS (LNAI), vol. 2381, pp. 160\u2013175. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45616-3_12"},{"key":"19_CR37","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1007\/978-3-319-63046-5_23","volume-title":"Automated Deduction \u2013 CADE 26","author":"F Lonsing","year":"2017","unstructured":"Lonsing, F., Egly, U.: DepQBF 6.0: a search-based QBF solver beyond traditional QCDCL. In: de Moura, L. (ed.) CADE 2017. LNCS (LNAI), vol. 10395, pp. 371\u2013384. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63046-5_23"},{"key":"19_CR38","unstructured":"Lonsing, F., Egly, U.: Evaluating QBF solvers: quantifier alternations matter. CoRR abs\/1701.06612 (2018). http:\/\/arxiv.org\/abs\/1701.06612 , CP 2018 proceedings version with appendix"},{"key":"19_CR39","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.artint.2016.04.002","volume":"237","author":"F Lonsing","year":"2016","unstructured":"Lonsing, F., Seidl, M., Van Gelder, A.: The QBF gallery: behind the scenes. Artif. Intell. 237, 92\u2013114 (2016)","journal-title":"Artif. Intell."},{"issue":"1\u20132","key":"19_CR40","doi-asserted-by":"publisher","first-page":"133","DOI":"10.3233\/FI-2016-1445","volume":"149","author":"P Marin","year":"2016","unstructured":"Marin, P., Narizzano, M., Pulina, L., Tacchella, A., Giunchiglia, E.: Twelve years of QBF evaluations: QSAT is PSPACE-hard and it shows. Fundam. Inf. 149(1\u20132), 133\u2013158 (2016)","journal-title":"Fundam. Inf."},{"key":"19_CR41","unstructured":"Martin, B.: Quantified constraints in twenty seventeen. In: The Constraint Satisfaction Problem: Complexity and Approximability, Dagstuhl Follow-Ups, vol. 7, pp. 327\u2013346. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)"},{"key":"19_CR42","doi-asserted-by":"crossref","unstructured":"Meyer, A.R., Stockmeyer, L.J.: The equivalence problem for regular expressions with squaring requires exponential space. In: 13th Annual Symposium on Switching and Automata Theory, pp. 125\u2013129. IEEE Computer Society (1972)","DOI":"10.1109\/SWAT.1972.29"},{"key":"19_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-319-66263-3_19","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2017","author":"T Peitl","year":"2017","unstructured":"Peitl, T., Slivovsky, F., Szeider, S.: Dependency learning for QBF. In: Gaspers, S., Walsh, T. (eds.) SAT 2017. LNCS, vol. 10491, pp. 298\u2013313. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66263-3_19"},{"key":"19_CR44","unstructured":"Pulina, L., Seidl, M.: QBFEVAL\u201917: competitive evaluation of QBF solvers (2017). http:\/\/www.qbflib.org\/event_page.php?year=2017"},{"key":"19_CR45","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"528","DOI":"10.1007\/978-3-540-89439-1_37","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"L Pulina","year":"2008","unstructured":"Pulina, L., Tacchella, A.: Treewidth: a useful marker of empirical hardness in quantified Boolean Logic Encodings. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol. 5330, pp. 528\u2013542. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-89439-1_37"},{"key":"19_CR46","doi-asserted-by":"crossref","unstructured":"Rabe, M.N., Tentrup, L.: CAQE: a certifying QBF solver. In: FMCAD, pp. 136\u2013143. IEEE (2015)","DOI":"10.1109\/FMCAD.2015.7542263"},{"key":"19_CR47","unstructured":"Silva, J.P.M., Lynce, I., Malik, S.: Conflict-driven clause learning SAT solvers. In: Handbook of Satisfiability, FAIA, vol. 185, pp. 131\u2013153. IOS Press (2009)"},{"issue":"1","key":"19_CR48","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(76)90061-X","volume":"3","author":"LJ Stockmeyer","year":"1976","unstructured":"Stockmeyer, L.J.: The polynomial-time hierarchy. Theor. Comput. Sci. 3(1), 1\u201322 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR49","doi-asserted-by":"crossref","unstructured":"Stockmeyer, L.J., Meyer, A.R.: Word problems requiring exponential time: preliminary report. In: STOC, pp. 1\u20139. ACM (1973)","DOI":"10.1145\/800125.804029"},{"key":"19_CR50","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/978-3-319-63390-9_25","volume-title":"Computer Aided Verification","author":"L Tentrup","year":"2017","unstructured":"Tentrup, L.: On expansion and resolution in CEGAR based QBF solving. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10427, pp. 475\u2013494. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63390-9_25"},{"key":"19_CR51","doi-asserted-by":"crossref","unstructured":"Tseitin, G.S.: On the complexity of derivation in propositional calculus. Stud. Constr. Math. Math. Log., 115\u2013125 (1968)","DOI":"10.1007\/978-1-4899-5327-8_25"},{"key":"19_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/978-3-662-54577-5_21","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R Wimmer","year":"2017","unstructured":"Wimmer, R., Reimer, S., Marin, P., Becker, B.: HQSpre \u2013 an effective preprocessor for QBF and DQBF. In: Legay, A., Margaria, T. (eds.) TACAS 2017. LNCS, vol. 10205, pp. 373\u2013390. Springer, Heidelberg (2017). https:\/\/doi.org\/10.1007\/978-3-662-54577-5_21"},{"issue":"1","key":"19_CR53","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0304-3975(76)90062-1","volume":"3","author":"C Wrathall","year":"1976","unstructured":"Wrathall, C.: Complete sets and the polynomial-time hierarchy. Theor. Comput. Sci. 3(1), 23\u201333 (1976)","journal-title":"Theor. Comput. Sci."},{"key":"19_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"228","DOI":"10.1007\/978-3-642-31612-8_18","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2012","author":"L Xu","year":"2012","unstructured":"Xu, L., Hutter, F., Hoos, H., Leyton-Brown, K.: Evaluating component solver contributions to portfolio-based algorithm selectors. In: Cimatti, A., Sebastiani, R. (eds.) SAT 2012. LNCS, vol. 7317, pp. 228\u2013241. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-31612-8_18"},{"key":"19_CR55","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-46135-3_14","volume-title":"Principles and Practice of Constraint Programming - CP 2002","author":"L Zhang","year":"2002","unstructured":"Zhang, L., Malik, S.: Towards a symmetric treatment of satisfaction and conflicts in quantified Boolean formula evaluation. In: Van Hentenryck, P. (ed.) CP 2002. LNCS, vol. 2470, pp. 200\u2013215. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-46135-3_14"}],"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_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T13:27:13Z","timestamp":1751808433000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-98334-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319983332","9783319983349"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98334-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"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"}}]}}