{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:41:25Z","timestamp":1742913685444,"version":"3.40.3"},"publisher-location":"Cham","reference-count":51,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030300470"},{"type":"electronic","value":"9783030300487"}],"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-30048-7_14","type":"book-chapter","created":{"date-parts":[[2019,9,22]],"date-time":"2019-09-22T23:03:06Z","timestamp":1569193386000},"page":"232-250","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Constraint-Based Techniques in Stochastic Local Search MaxSAT Solving"],"prefix":"10.1007","author":[{"given":"Andreia P.","family":"Guerreiro","sequence":"first","affiliation":[]},{"given":"Miguel","family":"Terra-Neves","sequence":"additional","affiliation":[]},{"given":"In\u00eas","family":"Lynce","sequence":"additional","affiliation":[]},{"given":"Jos\u00e9 Rui","family":"Figueira","sequence":"additional","affiliation":[]},{"given":"Vasco","family":"Manquinho","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,9,23]]},"reference":[{"key":"14_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/978-3-642-40627-0_12","volume-title":"Principles and Practice of Constraint Programming","author":"C Ans\u00f3tegui","year":"2013","unstructured":"Ans\u00f3tegui, C., Bonet, M.L., Gab\u00e0s, J., Levy, J.: Improving WPM2 for (Weighted) partial MaxSAT. In: Schulte, C. (ed.) CP 2013. LNCS, vol. 8124, pp. 117\u2013132. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40627-0_12"},{"key":"14_CR2","first-page":"427","volume-title":"Lecture Notes in Computer Science","author":"Carlos Ans\u00f3tegui","year":"2009","unstructured":"Ans\u00f3tegui, C., Bonet, M.L., Levy, J.: Solving (Weighted) partial MaxSAT through satisfiability testing. In: Kullmann [30], pp. 427\u2013440"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.artint.2017.05.003","volume":"250","author":"C Ans\u00f3tegui","year":"2017","unstructured":"Ans\u00f3tegui, C., Gab\u00e0s, J.: WPM3: an (in)complete algorithm for weighted partial maxsat. Artif. Intell. 250, 37\u201357 (2017)","journal-title":"Artif. Intell."},{"issue":"1","key":"14_CR4","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10479-012-1081-x","volume":"218","author":"R As\u00edn","year":"2014","unstructured":"As\u00edn, R., Nieuwenhuis, R.: Curriculum-based course timetabling with SAT and MaxSAT. Ann. Oper. Res. 218(1), 71\u201391 (2014)","journal-title":"Ann. Oper. Res."},{"key":"14_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"474","DOI":"10.1007\/978-3-642-16242-8_34","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"G Audemard","year":"2010","unstructured":"Audemard, G., Lagniez, J.-M., Mazure, B., Sa\u00efs, L.: Boosting local search thanks to cdcl. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR 2010. LNCS, vol. 6397, pp. 474\u2013488. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16242-8_34"},{"key":"14_CR6","unstructured":"Audemard, G., Simon, L.: GUNSAT: a greedy local search algorithm for unsatisfiability. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence, pp. 2256\u20132261 (2007)"},{"key":"14_CR7","unstructured":"Bacchus, F., J\u00e4rvisalo, M.J., Martins, R., et\u00a0al.: MaxSAT evaluation 2018 (2018)"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-540-30557-6_14","volume-title":"Practical Aspects of Declarative Languages","author":"J Bailey","year":"2005","unstructured":"Bailey, J., Stuckey, P.J.: Discovery of minimal unsatisfiable subsets of constraints using hitting set dualization. In: Hermenegildo, M.V., Cabeza, D. (eds.) PADL 2005. LNCS, vol. 3350, pp. 174\u2013186. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/978-3-540-30557-6_14"},{"issue":"1","key":"14_CR9","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1080\/0952813021000026795","volume":"15","author":"E Birnbaum","year":"2003","unstructured":"Birnbaum, E., Lozinskii, E.: Consistent subsets of inconsistent systems: structure and behaviour. J. Exp. Theor. Artif. Intell. 15(1), 25\u201346 (2003)","journal-title":"J. Exp. Theor. Artif. Intell."},{"key":"14_CR10","unstructured":"Cai, S.: Balance between complexity and quality: local search for minimum vertex cover in massive graphs. In: Twenty-Fourth International Joint Conference on Artificial Intelligence (2015)"},{"key":"14_CR11","unstructured":"Cai, S., Luo, C., Thornton, J., Su, K.: Tailoring local search for partial maxsat. In: Brodley, C.E., Stone, P. (eds.) Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, Qu\u00e9bec City, Qu\u00e9bec, Canada, 27\u201331 July 2014, pp. 2623\u20132629. AAAI Press (2014)"},{"key":"14_CR12","unstructured":"Cai, S., Luo, C., Zhang, H.: From decimation to local search and back: a new approach to maxsat. In: Sierra, C. (ed.) Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, 19\u201325 August 2017, pp. 571\u2013577 (2017). ijcai.org"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-3-642-39071-5_13","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2013","author":"J Davies","year":"2013","unstructured":"Davies, J., Bacchus, F.: Exploiting the power of mip solvers in maxsat. In: J\u00e4rvisalo, M., Van Gelder, A. (eds.) SAT 2013. LNCS, vol. 7962, pp. 166\u2013181. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39071-5_13"},{"key":"14_CR14","unstructured":"Demirovic, E., Stuckey, P.J.: LinSBPS. MaxSAT Evaluation 2018: Solver and Benchmark Descriptions, volume B-2018-2 of Department of Computer Science Series of Publications B, University of Helsinki, pp. 8\u20139 (2018)"},{"key":"14_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/11814948_5","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"N Dershowitz","year":"2006","unstructured":"Dershowitz, N., Hanna, Z., Nadel, A.: A scalable algorithm for minimal unsatisfiable core extraction. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 36\u201341. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11814948_5"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"Niklas E\u00e9n","year":"2004","unstructured":"Een, N.: MiniSat: a sat solver with conflict-clause minimization. In: Proceedings SAT-05: 8th International Conference on Theory and Applications of Satisfiability Testing, pp. 502\u2013518 (2005)"},{"key":"14_CR17","unstructured":"Fan, Y., Ma, Z., Su, K., Sattar, A., Li, C.: Ramp: a local search solver based on make-positive variables. MaxSAT Evaluation (2016)"},{"key":"14_CR18","doi-asserted-by":"crossref","unstructured":"Fang, L., Hsiao, M.S.: A new hybrid solution to boost SAT solver performance. In: Design, Automation and Test in Europe Conference, pp. 1307\u20131313 (2007)","DOI":"10.1109\/DATE.2007.364478"},{"issue":"1","key":"14_CR19","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1017\/S0890060411000011","volume":"26","author":"A Felfernig","year":"2012","unstructured":"Felfernig, A., Schubert, M., Zehentner, C.: An efficient diagnosis algorithm for inconsistent constraint sets. Artif. Intell. Eng. Des. Anal. Manuf. 26(1), 53\u201362 (2012)","journal-title":"Artif. Intell. Eng. Des. Anal. Manuf."},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"Feng, Y., Bastani, O., Martins, R., Dillig, I., Anand, S.: Automated synthesis of semantic malware signatures using maximum satisfiability. In: 24th Annual Network and Distributed System Security Symposium, NDSS 2017, San Diego, California, USA, 26 February\u20131 March 2017. The Internet Society (2017)","DOI":"10.14722\/ndss.2017.23379"},{"key":"14_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/11814948_25","volume-title":"Theory and Applications of Satisfiability Testing - SAT 2006","author":"Z Fu","year":"2006","unstructured":"Fu, Z., Malik, S.: On solving the partial MAX-SAT problem. In: Biere, A., Gomes, C.P. (eds.) SAT 2006. LNCS, vol. 4121, pp. 252\u2013265. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11814948_25"},{"key":"14_CR22","unstructured":"Goldberg, E.I., Novikov, Y.: Verification of proofs of unsatisfiability for CNF formulas. In: Conference and Exposition on Design, Automation and Test in Europe, pp. 10886\u201310891 (2003)"},{"issue":"1","key":"14_CR23","doi-asserted-by":"publisher","first-page":"8","DOI":"10.1145\/130836.130837","volume":"3","author":"J Gu","year":"1992","unstructured":"Gu, J.: Efficient local search for very large-scale satisfiability problems. ACM SIGART Bull. 3(1), 8\u201312 (1992)","journal-title":"ACM SIGART Bull."},{"key":"14_CR24","doi-asserted-by":"crossref","unstructured":"Henard, C., Papadakis, M., Harman, M., Traon, Y.L.: Combining multi-objective search and constraint solving for configuring large software product lines. In: International Conference on Software Engineering, pp. 517\u2013528 (2015)","DOI":"10.1109\/ICSE.2015.69"},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Jose, M., Majumdar, R.: Cause clue clauses: error localization using maximum satisfiability. In: Programming Language Design and Implementation, pp. 437\u2013446. ACM (2011)","DOI":"10.1145\/1993316.1993550"},{"key":"14_CR26","unstructured":"Joshi, S., Kumar, P., Manquinho, V., Martins, R., Nadel, A., Rao, S.: Open-WBO-Inc in MaxSAT evaluation 2018. MaxSAT Evaluation 2018: Solver and Benchmark Descriptions, volume B-2018-2 of Department of Computer Science Series of Publications B, University of Helsinki, pp. 16\u201317 (2018)"},{"key":"14_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-3-319-98334-9_15","volume-title":"Principles and Practice of Constraint Programming","author":"S Joshi","year":"2018","unstructured":"Joshi, S., Kumar, P., Martins, R., Rao, S.: Approximation strategies for incomplete MaxSAT. In: Hooker, J. (ed.) CP 2018. LNCS, vol. 11008, pp. 219\u2013228. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98334-9_15"},{"key":"14_CR28","unstructured":"Kroc, L., Sabharwal, A., Gomes, C.P., Selman, B.: Integrating systematic and local search paradigms: a new strategy for MaxSAT. In: Boutilier, C. (ed.) IJCAI 2009, Proceedings of the 21st International Joint Conference on Artificial Intelligence, Pasadena, California, USA, 11\u201317 July 2009, pp. 544\u2013551 (2009)"},{"key":"14_CR29","unstructured":"Kugel, A.: akmaxsat and akmaxsat $$\\_$$ ls solver description. Technical report, MaxSAT Evaluation 2012 Solver Descriptions (2012)"},{"key":"14_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02777-2","volume-title":"International Conference on Theory and Applications ofSatisfiability Testing, LNCS","year":"2009","unstructured":"Kullmann, O. (ed.): International Conference on Theory and Applications ofSatisfiability Testing, LNCS, vol. 5584. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02777-2"},{"key":"14_CR31","unstructured":"Lang, J. (ed.): Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, IJCAI 2018, 13\u201319 July 2018, Stockholm, Sweden (2018). ijcai.org"},{"key":"14_CR32","unstructured":"Lei, Z., Cai, S.: SATlike-c. MaxSAT Evaluation 2018: Solver and Benchmark Descriptions, volume B-2018-2 of Department of Computer Science Series of Publications B, University of Helsinki, pp. 24\u201325 (2018)"},{"key":"14_CR33","unstructured":"Lei, Z., Cai, S.: Solving (weighted) partial maxsat by dynamic local search for SAT. In: Lang [33], pp. 1346\u20131352"},{"issue":"06","key":"14_CR34","doi-asserted-by":"publisher","first-page":"1250025","DOI":"10.1142\/S021821301250025X","volume":"21","author":"FLORIAN LETOMBE","year":"2012","unstructured":"Letombe, F., Marques-Silva, J.: Hybrid incremental algorithms for booleansatisfiability. Int. J. Artif. Intell. Tools 21(6) (2012). https:\/\/doi.org\/10.1142\/S021821301250025X","journal-title":"International Journal on Artificial Intelligence Tools"},{"key":"14_CR35","unstructured":"Li, C.M., Many\u00e0, F.: MaxSAT, hard and soft constraints. In: Handbook of Satisfiability, pp. 613\u2013631. IOS Press (2009)"},{"key":"14_CR36","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1016\/j.artint.2016.11.001","volume":"243","author":"C Luo","year":"2017","unstructured":"Luo, C., Cai, S., Su, K., Huang, W.: CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability. Artif. Intell. 243, 26\u201344 (2017)","journal-title":"Artif. Intell."},{"issue":"7","key":"14_CR37","doi-asserted-by":"publisher","first-page":"1830","DOI":"10.1109\/TC.2014.2346196","volume":"64","author":"C Luo","year":"2015","unstructured":"Luo, C., Cai, S., Wu, W., Jie, Z., Su, K.: CCLS: an efficient local search algorithm for weighted maximum satisfiability. IEEE Trans. Computers 64(7), 1830\u20131843 (2015)","journal-title":"IEEE Trans. Computers"},{"key":"14_CR38","first-page":"495","volume-title":"Lecture Notes in Computer Science","author":"Vasco Manquinho","year":"2009","unstructured":"Manquinho, V., Marques-Silva, J., Planes, J.: Algorithms for Weighted Boolean Optimization. In: Kullmann [30], pp. 495\u2013508"},{"key":"14_CR39","unstructured":"Marques-Silva, J., Heras, F., Janota, M., Previti, A., Belov, A.: On Computing Minimal Correction Subsets. In: International Joint Conference on Artificial Intelligence, pp. 615\u2013622 (2013)"},{"key":"14_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/978-3-319-10428-7_39","volume-title":"Principles and Practice of Constraint Programming","author":"R Martins","year":"2014","unstructured":"Martins, R., Joshi, S., Manquinho, V., Lynce, I.: Incremental cardinality constraints for MaxSAT. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 531\u2013548. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10428-7_39"},{"key":"14_CR41","unstructured":"Menc\u00eda, C., Previti, A., Marques-Silva, J.: Literal-based MCS extraction. In: International Joint Conference on Artificial Intelligence, pp. 1973\u20131979 (2015)"},{"key":"14_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1007\/978-3-319-10428-7_41","volume-title":"Principles and Practice of Constraint Programming","author":"A Morgado","year":"2014","unstructured":"Morgado, A., Dodaro, C., Marques-Silva, J.: Core-guided MaxSAT with soft cardinality constraints. In: O\u2019Sullivan, B. (ed.) CP 2014. LNCS, vol. 8656, pp. 564\u2013573. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10428-7_41"},{"key":"14_CR43","first-page":"129","volume":"9","author":"A Morgado","year":"2014","unstructured":"Morgado, A., Ignatiev, A., Marques-Silva, J.: MSCG: robust core-guided maxsat solving. JSAT 9, 129\u2013134 (2014)","journal-title":"JSAT"},{"key":"14_CR44","doi-asserted-by":"crossref","unstructured":"Narodytska, N., Bacchus, F.: Maximum satisfiability using core-guided MaxSAT resolution. In: AAAI Conference on Artificial Intelligence, pp. 2717\u20132723. AAAI Press (2014)","DOI":"10.1609\/aaai.v28i1.9124"},{"key":"14_CR45","doi-asserted-by":"crossref","unstructured":"Safarpour, S., Mangassarian, H., Veneris, A.G., Liffiton, M.H., Sakallah, K.A.: Improved design debugging using maximum satisfiability. In: Formal Methods in Computer-Aided Design, pp. 13\u201319. IEEE Computer Society (2007)","DOI":"10.1109\/FMCAD.2007.4401977"},{"key":"14_CR46","unstructured":"Selman, B., Kautz, H.A., Cohen, B.: Local search strategies for satisfiability testing. In: Johnson, D.S., Trick, M.A. (eds.) Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, 11\u201313 October 1993. DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 26, pp. 521\u2013532. DIMACS\/AMS (1993)"},{"key":"14_CR47","first-page":"12","volume":"2017","author":"T Sugawara","year":"2017","unstructured":"Sugawara, T.: Maxroster: solver description. MaxSAT Eval. 2017, 12 (2017)","journal-title":"MaxSAT Eval."},{"key":"14_CR48","doi-asserted-by":"crossref","unstructured":"Terra-Neves, M., Machado, N., Lynce, I., Manquinho, V.: Concurrency debugging with maxSMT. In: AAAI Conference on Artificial Intelligence. AAAI Press (2019)","DOI":"10.1609\/aaai.v33i01.33011608"},{"key":"14_CR49","unstructured":"Terra-Neves, M., Lynce, I., Manquinho, V.M.: Stratification for constraint-based multi-objective combinatorial optimization. In: Lang [31], pp. 1376\u20131382"},{"key":"14_CR50","unstructured":"Tompkins, D.A.D., Hoos, H.H.: UBCSAT: an implementation and experimentation environment for SLS algorithms for SAT & MAX-SAT. In: The Seventh International Conference on Theory and Applications of Satisfiability Testing, SAT 2004, 10\u201313 May 2004, Vancouver, BC, Canada, Online Proceedings (2004)"},{"key":"14_CR51","unstructured":"Zhang, J., Zhang, H.: Combining local search and backtracking techniques for constraint satisfaction. In: Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, pp. 369\u2013374 (1996)"}],"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-030-30048-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,29]],"date-time":"2022-09-29T07:17:51Z","timestamp":1664435871000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30048-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030300470","9783030300487"],"references-count":51,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30048-7_14","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":"23 September 2019","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":"Stamford, CT","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"30 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cp2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cp2019.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 (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":"118","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":"46","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":"0","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":"39% - 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.2","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":"4","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)"}}]}}