{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:32:23Z","timestamp":1767929543592,"version":"3.49.0"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030452599","type":"print"},{"value":"9783030452605","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-45260-5_4","type":"book-chapter","created":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T14:02:31Z","timestamp":1587477751000},"page":"57-72","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Computing Abstract Distances in Logic Programs"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9196-7951","authenticated-orcid":false,"given":"Ignacio","family":"Casso","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6098-3895","authenticated-orcid":false,"given":"Jos\u00e9 F.","family":"Morales","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1092-2071","authenticated-orcid":false,"given":"Pedro","family":"L\u00f3pez-Garc\u00eda","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9582-3960","authenticated-orcid":false,"given":"Roberto","family":"Giacobazzi","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7583-323X","authenticated-orcid":false,"given":"Manuel V.","family":"Hermenegildo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,4,22]]},"reference":[{"key":"4_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/3-540-58485-4_46","volume-title":"Static Analysis","author":"T Armstrong","year":"1994","unstructured":"Armstrong, T., Marriott, K., Schachte, P., S\u00f8ndergaard, H.: Boolean functions for dependency analysis: algebraic properties and efficient representation. In: Le Charlier, B. (ed.) SAS 1994. LNCS, vol. 864, pp. 266\u2013280. Springer, Heidelberg (1994). \nhttps:\/\/doi.org\/10.1007\/3-540-58485-4_46"},{"key":"4_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-00515-2_5","volume-title":"Logic-Based Program Synthesis and Transformation","author":"G Banda","year":"2009","unstructured":"Banda, G., Gallagher, J.P.: Analysis of linear hybrid systems in CLP. In: Hanus, M. (ed.) LOPSTR 2008. LNCS, vol. 5438, pp. 55\u201370. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-00515-2_5"},{"key":"4_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-319-23534-9_2","volume-title":"Fields of Logic and Computation II","author":"N Bj\u00f8rner","year":"2015","unstructured":"Bj\u00f8rner, N., Gurfinkel, A., McMillan, K., Rybalchenko, A.: Horn clause solvers for program verification. In: Beklemishev, L.D., Blass, A., Dershowitz, N., Finkbeiner, B., Schulte, W. (eds.) Fields of Logic and Computation II. LNCS, vol. 9300, pp. 24\u201351. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-23534-9_2"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1016\/0743-1066(91)80001-T","volume":"10","author":"M Bruynooghe","year":"1991","unstructured":"Bruynooghe, M.: A practical framework for the abstract interpretation of logic programs. J. Logic Program. 10, 91\u2013124 (1991)","journal-title":"J. Logic Program."},{"key":"4_CR5","unstructured":"Bueno, F., Garc\u00eda de la Banda, M., Hermenegildo, M.V.: Effectiveness of global analysis in strict independence-based automatic program parallelization. In: International Symposium on Logic Programming, pp. 320\u2013336. MIT Press, November 1994"},{"key":"4_CR6","unstructured":"Casso, I., Morales, J.F., Lopez-Garcia, P., Hermenegildo, M.V.: Computing abstract distances in logic programs. Technical report CLIP-2\/2019.0, The CLIP Lab, IMDEA Software Institute and T.U., Madrid, July 2019. \nhttp:\/\/arxiv.org\/abs\/1907.13263"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1007\/3-540-55719-9_101","volume-title":"Automata, Languages and Programming","author":"A Cortesi","year":"1992","unstructured":"Cortesi, A., Fil\u00e9, G., Winsborough, W.: Comparison of abstract interpretations. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol. 623, pp. 521\u2013532. Springer, Heidelberg (1992). \nhttps:\/\/doi.org\/10.1007\/3-540-55719-9_101"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Proceedings of POPL 1977, pp. 238\u2013252. ACM Press (1977)","DOI":"10.1145\/512950.512973"},{"key":"4_CR9","first-page":"157","volume-title":"Types in Logic Programming","author":"P Dart","year":"1992","unstructured":"Dart, P., Zobel, J.: A Regular type language for logic programs. In: Pfenning, F. (ed.) Types in Logic Programming, pp. 157\u2013187. MIT Press, Cambridge (1992)"},{"key":"4_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1007\/978-3-642-54862-8_47","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E Angelis De","year":"2014","unstructured":"De Angelis, E., Fioravanti, F., Pettorossi, A., Proietti, M.: VeriMAP: a tool for verifying programs through transformations. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 568\u2013574. Springer, Heidelberg (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-642-54862-8_47"},{"issue":"3","key":"4_CR11","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.patrec.2008.09.007","volume":"30","author":"L Raedt De","year":"2009","unstructured":"De Raedt, L., Ramon, J.: Deriving distance metrics from generality relations. Pattern Recogn. Lett. 30(3), 187\u2013191 (2009). \nhttps:\/\/doi.org\/10.1016\/j.patrec.2008.09.007","journal-title":"Pattern Recogn. Lett."},{"issue":"3","key":"4_CR12","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1145\/65979.65983","volume":"11","author":"SK Debray","year":"1989","unstructured":"Debray, S.K.: Static inference of modes and data dependencies in logic programs. ACM Trans. Program. Lang. Syst. 11(3), 418\u2013450 (1989)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"4_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-45142-0_9","volume-title":"Logic Based Program Synthesis and Transformation","author":"A Pierro Di","year":"2001","unstructured":"Di Pierro, A., Wiklicky, H.: Measuring the precision of abstract interpretations. LOPSTR 2000. LNCS, vol. 2042, pp. 147\u2013164. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-45142-0_9"},{"issue":"5\u20136","key":"4_CR14","first-page":"721","volume":"16","author":"I Garcia-Contreras","year":"2016","unstructured":"Garcia-Contreras, I., Morales, J.F., Hermenegildo, M.V.: Semantic code browsing. TPLP (ICLP 2016 Special Issue) 16(5\u20136), 721\u2013737 (2016)","journal-title":"TPLP (ICLP 2016 Special Issue)"},{"key":"4_CR15","unstructured":"Garc\u00eda de la Banda, M., Hermenegildo, M.V.: A practical application of sharing and freeness inference. In: 1992 Workshop on Static Analysis, WSA 1992, pp. 118\u2013125. No. 81\u201382 in BIGRE. IRISA, Beaulieu, September 1992"},{"issue":"5","key":"4_CR16","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1145\/232706.232734","volume":"18","author":"MG Banda de la","year":"1996","unstructured":"de la Banda, M.G., Hermenegildo, M.V., Bruynooghe, M., Dumortier, V., Janssens, G., Simoens, W.: Global analysis of constraint logic programs. ACM TOPLAS 18(5), 564\u2013614 (1996)","journal-title":"ACM TOPLAS"},{"key":"4_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1007\/978-3-642-28756-5_46","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"S Grebenshchikov","year":"2012","unstructured":"Grebenshchikov, S., Gupta, A., Lopes, N.P., Popeea, C., Rybalchenko, A.: HSF(C): a software verifier based on Horn clauses. In: Flanagan, C., K\u00f6nig, B. (eds.) TACAS 2012. LNCS, vol. 7214, pp. 549\u2013551. Springer, Heidelberg (2012). \nhttps:\/\/doi.org\/10.1007\/978-3-642-28756-5_46"},{"key":"4_CR18","doi-asserted-by":"publisher","unstructured":"Gr\u00e4tzer, G.: General Lattice Theory, 2nd edn. (1998). \nhttps:\/\/doi.org\/10.1007\/978-3-0348-7633-9","DOI":"10.1007\/978-3-0348-7633-9"},{"key":"4_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-319-21690-4_20","volume-title":"Computer Aided Verification","author":"A Gurfinkel","year":"2015","unstructured":"Gurfinkel, A., Kahsai, T., Komuravelli, A., Navas, J.A.: The SeaHorn verification framework. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9206, pp. 343\u2013361. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-21690-4_20"},{"issue":"1\u20132","key":"4_CR20","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.scico.2005.02.006","volume":"58","author":"M Hermenegildo","year":"2005","unstructured":"Hermenegildo, M., Puebla, G., Bueno, F., Lopez-Garcia, P.: Integrated program debugging, verification, and optimization using abstract interpretation (and the Ciao system preprocessor). Sci. Comput. Progr. 58(1\u20132), 115\u2013140 (2005)","journal-title":"Sci. Comput. Progr."},{"issue":"4","key":"4_CR21","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/0743-1066(92)90053-6","volume":"13","author":"M Hermenegildo","year":"1992","unstructured":"Hermenegildo, M., Warren, R., Debray, S.K.: Global flow analysis as a practical compilation tool. JLP 13(4), 349\u2013367 (1992)","journal-title":"JLP"},{"issue":"3","key":"4_CR22","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1090\/S0002-9947-1948-0028922-8","volume":"64","author":"A Horn","year":"1948","unstructured":"Horn, A., Tarski, A.: Measures in Boolean algebras. Trans. Am. Math. Soc. 64(3), 467\u2013497 (1948)","journal-title":"Trans. Am. Math. Soc."},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/3-540-62858-4_78","volume-title":"Machine Learning: ECML 1997","author":"A Hutchinson","year":"1997","unstructured":"Hutchinson, A.: Metrics on terms and clauses. In: van Someren, M., Widmer, G. (eds.) ECML 1997. LNCS, vol. 1224, pp. 138\u2013145. Springer, Heidelberg (1997). \nhttps:\/\/doi.org\/10.1007\/3-540-62858-4_78"},{"key":"4_CR24","unstructured":"Jacobs, D., Langen, A.: Accurate and efficient approximation of variable aliasing in logic programs. In: North American Conference on Logic Programming (1989)"},{"key":"4_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/978-3-319-41528-4_14","volume-title":"Computer Aided Verification","author":"B Kafle","year":"2016","unstructured":"Kafle, B., Gallagher, J.P., Morales, J.F.: Rahft: a tool for verifying horn clauses using abstract interpretation and finite tree automata. In: Chaudhuri, S., Farzan, A. (eds.) CAV 2016. LNCS, vol. 9779, pp. 261\u2013268. Springer, Cham (2016). \nhttps:\/\/doi.org\/10.1007\/978-3-319-41528-4_14"},{"key":"4_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1007\/3-540-60299-2_14","volume-title":"Principles and Practice of Constraint Programming \u2014 CP 1995","author":"AD Kelly","year":"1995","unstructured":"Kelly, A.D., Macdonald, A., Marriott, K., S\u00f8ndergaard, H., Stuckey, P.J., Yap, R.H.C.: An optimizing compiler for CLP $$\\mathscr {R}$$. In: Montanari, U., Rossi, F. (eds.) CP 1995. LNCS, vol. 976, pp. 222\u2013239. Springer, Heidelberg (1995). \nhttps:\/\/doi.org\/10.1007\/3-540-60299-2_14"},{"key":"4_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-319-14125-1_5","volume-title":"Logic-Based Program Synthesis and Transformation","author":"U Liqat","year":"2014","unstructured":"Liqat, U., et al.: Energy consumption analysis of programs based on XMOS ISA-level models. In: Gupta, G., Pe\u00f1a, R. (eds.) LOPSTR 2013. LNCS, vol. 8901, pp. 72\u201390. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-14125-1_5"},{"key":"4_CR28","unstructured":"Logozzo, F., Popeea, C., Laviron, V.: Towards a quantitative estimation of abstract interpretations (extended abstract). In: Workshop on Quantitative Analysis of Software, June 2009"},{"key":"4_CR29","doi-asserted-by":"crossref","unstructured":"Madsen, M., Yee, M., Lhot\u00e1k, O.: From Datalog to FLIX: a declarative language for fixed points on lattices. In: PLDI, pp. 194\u2013208. ACM (2016)","DOI":"10.1145\/2980983.2908096"},{"issue":"3","key":"4_CR30","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1145\/177492.177650","volume":"16","author":"K Marriott","year":"1994","unstructured":"Marriott, K., S\u00f8ndergaard, H., Jones, N.: Denotational abstract interpretation of logic programs. ACM Trans. Program. Lang. Syst. 16(3), 607\u2013648 (1994)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"4_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-540-78769-3_11","volume-title":"Logic-Based Program Synthesis and Transformation","author":"M M\u00e9ndez-Lojo","year":"2008","unstructured":"M\u00e9ndez-Lojo, M., Navas, J., Hermenegildo, M.V.: A flexible, (C)LP-based approach to the analysis of object-oriented programs. In: King, A. (ed.) LOPSTR 2007. LNCS, vol. 4915, pp. 154\u2013168. Springer, Heidelberg (2008). \nhttps:\/\/doi.org\/10.1007\/978-3-540-78769-3_11"},{"key":"4_CR32","unstructured":"Muthukumar, K., Hermenegildo, M.: Determination of variable dependence information at compile-time through abstract interpretation. In: NACLP 1989, pp. 166\u2013189. MIT Press, October 1989"},{"key":"4_CR33","unstructured":"Muthukumar, K., Hermenegildo, M.: Combined determination of sharing and freeness of program variables through abstract interpretation. In: ICLP 1991, pp. 49\u201363. MIT Press, June 1991"},{"key":"4_CR34","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/11603023_13","volume-title":"Practical Aspects of Declarative Languages","author":"J Navas","year":"2005","unstructured":"Navas, J., Bueno, F., Hermenegildo, M.: Efficient top-down set-sharing analysis using cliques. In: Van Hentenryck, P. (ed.) PADL 2006. LNCS, vol. 3819, pp. 183\u2013198. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11603023_13"},{"key":"4_CR35","doi-asserted-by":"crossref","unstructured":"Navas, J., M\u00e9ndez-Lojo, M., Hermenegildo, M.V.: User-definable resource usage bounds analysis for Java bytecode. In: BYTECODE 2009. ENTCS, vol. 253. Elsevier, March 2009","DOI":"10.1016\/j.entcs.2009.11.015"},{"key":"4_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/3540635149_50","volume-title":"Inductive Logic Programming","author":"S-H Nienhuys-Cheng","year":"1997","unstructured":"Nienhuys-Cheng, S.-H.: Distance between Herbrand interpretations: a measure for approximations to a target concept. In: Lavra\u010d, N., D\u017eeroski, S. (eds.) ILP 1997. LNCS, vol. 1297, pp. 213\u2013226. Springer, Heidelberg (1997). \nhttps:\/\/doi.org\/10.1007\/3540635149_50"},{"key":"4_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/10722311_2","volume-title":"Analysis and Visualization Tools for Constraint Programming","author":"G Puebla","year":"2000","unstructured":"Puebla, G., Bueno, F., Hermenegildo, M.: An assertion language for constraint logic programs. In: Deransart, P., Hermenegildo, M.V., Ma\u0142uszynski, J. (eds.) Analysis and Visualization Tools for Constraint Programming. LNCS, vol. 1870, pp. 23\u201361. Springer, Heidelberg (2000). \nhttps:\/\/doi.org\/10.1007\/10722311_2"},{"key":"4_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/BFb0027331","volume-title":"Inductive Logic Programming","author":"J Ramon","year":"1998","unstructured":"Ramon, J., Bruynooghe, M.: A framework for defining distances between first-order logic objects. In: Page, D. (ed.) ILP 1998. LNCS, vol. 1446, pp. 271\u2013280. Springer, Heidelberg (1998). \nhttps:\/\/doi.org\/10.1007\/BFb0027331"},{"key":"4_CR39","unstructured":"Sotin, P.: Quantifying the precision of numerical abstract domains. Research report, INRIA, February 2010. \nhttps:\/\/hal.inria.fr\/inria-00457324"},{"key":"4_CR40","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/2.108055","volume":"25","author":"P Roy Van","year":"1992","unstructured":"Van Roy, P., Despain, A.: High-performance logic programming with the aquarius prolog compiler. IEEE Comput. Mag. 25, 54\u201368 (1992)","journal-title":"IEEE Comput. Mag."}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-45260-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,21]],"date-time":"2020-04-21T14:02:52Z","timestamp":1587477772000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-45260-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030452599","9783030452605"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-45260-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"22 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LOPSTR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Logic-Based Program Synthesis and Transformation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Porto","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":"8 October 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 October 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lopstr2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.cs.unibo.it\/projects\/lopstr19\/","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":"32","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":"15","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":"47% - 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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}