{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T07:05:50Z","timestamp":1760598350728,"version":"3.40.3"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031492983"},{"type":"electronic","value":"9783031492990"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-49299-0_1","type":"book-chapter","created":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T05:06:49Z","timestamp":1703135209000},"page":"1-15","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Constrained Optimization Approach to\u00a0Set the\u00a0Parameters of\u00a0Probabilistic Answer Set Programs"],"prefix":"10.1007","author":[{"given":"Damiano","family":"Azzolini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,22]]},"reference":[{"issue":"2","key":"1_CR1","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s13218-018-0545-9","volume":"32","author":"M Alviano","year":"2018","unstructured":"Alviano, M., Faber, W.: Aggregates in answer set programming. KI-K\u00fcnstliche Intelligenz 32(2), 119\u2013124 (2018). https:\/\/doi.org\/10.1007\/s13218-018-0545-9","journal-title":"KI-K\u00fcnstliche Intelligenz"},{"issue":"3\u20134","key":"1_CR2","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1017\/S1471068418000285","volume":"18","author":"J Arias","year":"2018","unstructured":"Arias, J., Carro, M., Salazar, E., Marple, K., Gupta, G.: Constraint answer set programming without grounding. Theory Pract. Logic Program. 18(3\u20134), 337\u2013354 (2018). https:\/\/doi.org\/10.1017\/S1471068418000285","journal-title":"Theory Pract. Logic Program."},{"key":"1_CR3","doi-asserted-by":"publisher","unstructured":"Azzolini, D., Bellodi, E., Riguzzi, F.: Statistical statements in probabilistic logic programming. In: Gottlob, G., Inclezan, D., Maratea, M. (eds.) Logic Programming and Nonmonotonic Reasoning, pp. 43\u201355. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-15707-3_4","DOI":"10.1007\/978-3-031-15707-3_4"},{"key":"1_CR4","doi-asserted-by":"publisher","unstructured":"Azzolini, D., Bellodi, E., Riguzzi, F.: Approximate inference in probabilistic answer set programming for statistical probabilities. In: Dovier, A., Montanari, A., Orlandini, A. (eds.) AIxIA 2022 - Advances in Artificial Intelligence, pp. 33\u201346. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-27181-6_3","DOI":"10.1007\/978-3-031-27181-6_3"},{"key":"1_CR5","doi-asserted-by":"publisher","unstructured":"Azzolini, D., Bellodi, E., Riguzzi, F.: MAP inference in probabilistic answer set programs. In: Dovier, A., Montanari, A., Orlandini, A. (eds.) AIxIA 2022 - Advances in Artificial Intelligence, pp. 413\u2013426. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-27181-6_29","DOI":"10.1007\/978-3-031-27181-6_29"},{"issue":"5","key":"1_CR6","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1017\/S1471068421000260","volume":"21","author":"D Azzolini","year":"2021","unstructured":"Azzolini, D., Riguzzi, F.: Optimizing probabilities in probabilistic logic programs. Theory Pract. Logic Program. 21(5), 543\u2013556 (2021). https:\/\/doi.org\/10.1017\/S1471068421000260","journal-title":"Theory Pract. Logic Program."},{"key":"1_CR7","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2021.103452","volume":"294","author":"D Azzolini","year":"2021","unstructured":"Azzolini, D., Riguzzi, F., Lamma, E.: A semantics for hybrid probabilistic logic programs with function symbols. Artif. Intell. 294, 103452 (2021). https:\/\/doi.org\/10.1016\/j.artint.2021.103452","journal-title":"Artif. Intell."},{"key":"1_CR8","doi-asserted-by":"publisher","unstructured":"Babaki, B., Guns, T., de Raedt, L.: Stochastic constraint programming with and-or branch-and-bound. In: Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI-2017, pp. 539\u2013545 (2017). https:\/\/doi.org\/10.24963\/ijcai.2017\/76","DOI":"10.24963\/ijcai.2017\/76"},{"issue":"1","key":"1_CR9","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1017\/S1471068408003645","volume":"9","author":"C Baral","year":"2009","unstructured":"Baral, C., Gelfond, M., Rushton, N.: Probabilistic reasoning with answer sets. Theory Pract. Logic Program. 9(1), 57\u2013144 (2009). https:\/\/doi.org\/10.1017\/S1471068408003645","journal-title":"Theory Pract. Logic Program."},{"issue":"2","key":"1_CR10","doi-asserted-by":"publisher","first-page":"343","DOI":"10.3233\/IDA-130582","volume":"17","author":"E Bellodi","year":"2013","unstructured":"Bellodi, E., Riguzzi, F.: Expectation maximization over binary decision diagrams for probabilistic logic programs. Intell. Data Anal. 17(2), 343\u2013363 (2013). https:\/\/doi.org\/10.3233\/IDA-130582","journal-title":"Intell. Data Anal."},{"issue":"12","key":"1_CR11","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1145\/2043174.2043195","volume":"54","author":"G Brewka","year":"2011","unstructured":"Brewka, G., Eiter, T., Truszczy\u0144ski, M.: Answer set programming at a glance. Commun. ACM 54(12), 92\u2013103 (2011). https:\/\/doi.org\/10.1145\/2043174.2043195","journal-title":"Commun. ACM"},{"key":"1_CR12","unstructured":"Cozman, F.G., Mau\u00e1, D.D.: The structure and complexity of credal semantics. In: Hommersom, A., Abdallah, S.A. (eds.) PLP 2016. CEUR Workshop Proceedings, vol. 1661, pp. 3\u201314. CEUR-WS.org (2016)"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1016\/j.ijar.2020.07.004","volume":"125","author":"FG Cozman","year":"2020","unstructured":"Cozman, F.G., Mau\u00e1, D.D.: The joy of probabilistic answer set programming: semantics, complexity, expressivity, inference. Int. J. Approx. Reason. 125, 218\u2013239 (2020). https:\/\/doi.org\/10.1016\/j.ijar.2020.07.004","journal-title":"Int. J. Approx. Reason."},{"key":"1_CR14","unstructured":"De Raedt, L., Kimmig, A., Toivonen, H.: ProbLog: a probabilistic prolog and its application in link discovery. In: Veloso, M.M. (ed.) IJCAI 2007, vol. 7, pp. 2462\u20132467. AAAI Press (2007)"},{"issue":"1","key":"1_CR15","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1017\/S1471068418000054","volume":"19","author":"M Gebser","year":"2019","unstructured":"Gebser, M., Kaminski, R., Kaufmann, B., Schaub, T.: Multi-shot ASP solving with clingo. Theory Pract. Logic Program. 19(1), 27\u201382 (2019). https:\/\/doi.org\/10.1017\/S1471068418000054","journal-title":"Theory Pract. Logic Program."},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/978-3-642-01929-6_7","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"M Gebser","year":"2009","unstructured":"Gebser, M., Kaufmann, B., Schaub, T.: Solution enumeration for projected boolean search problems. In: van Hoeve, W.-J., Hooker, J.N. (eds.) CPAIOR 2009. LNCS, vol. 5547, pp. 71\u201386. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01929-6_7"},{"key":"1_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-642-02846-5_22","volume-title":"Logic Programming","author":"M Gebser","year":"2009","unstructured":"Gebser, M., Ostrowski, M., Schaub, T.: Constraint answer set solving. In: Hill, P.M., Warren, D.S. (eds.) ICLP 2009. LNCS, vol. 5649, pp. 235\u2013249. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02846-5_22"},{"key":"1_CR18","unstructured":"Gelfond, M., Lifschitz, V.: The stable model semantics for logic programming. In: 5th International Conference and Symposium on Logic Programming (ICLP\/SLP 1988), vol. 88, pp. 1070\u20131080. MIT Press, USA (1988)"},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/978-3-540-87479-9_49","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"B Gutmann","year":"2008","unstructured":"Gutmann, B., Kimmig, A., Kersting, K., De Raedt, L.: Parameter learning in probabilistic databases: a least squares approach. In: Daelemans, W., Goethals, B., Morik, K. (eds.) ECML PKDD 2008. LNCS (LNAI), vol. 5211, pp. 473\u2013488. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-87479-9_49"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"581","DOI":"10.1007\/978-3-642-23780-5_47","volume-title":"Machine Learning and Knowledge Discovery in Databases","author":"B Gutmann","year":"2011","unstructured":"Gutmann, B., Thon, I., De Raedt, L.: Learning the parameters of probabilistic logic programs from interpretations. In: Gunopulos, D., Hofmann, T., Malerba, D., Vazirgiannis, M. (eds.) ECML PKDD 2011. LNCS (LNAI), vol. 6911, pp. 581\u2013596. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23780-5_47"},{"issue":"3","key":"1_CR21","doi-asserted-by":"publisher","first-page":"262","DOI":"10.1145\/192115.192124","volume":"20","author":"D Kraft","year":"1994","unstructured":"Kraft, D.: Algorithm 733: TOMP-fortran modules for optimal control calculations. ACM Trans. Math. Softw. 20(3), 262\u2013281 (1994). https:\/\/doi.org\/10.1145\/192115.192124","journal-title":"ACM Trans. Math. Softw."},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/978-3-319-66158-2_32","volume-title":"Principles and Practice of Constraint Programming","author":"ALD Latour","year":"2017","unstructured":"Latour, A.L.D., Babaki, B., Dries, A., Kimmig, A., Van den Broeck, G., Nijssen, S.: Combining stochastic constraint optimization and probabilistic programming. In: Beck, J.C. (ed.) CP 2017. LNCS, vol. 10416, pp. 495\u2013511. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66158-2_32"},{"key":"1_CR23","unstructured":"Lee, J., Wang, Y.: Weighted rules under the stable model semantics. In: Baral, C., Delgrande, J.P., Wolter, F. (eds.) Proceedings of the Fifteenth International Conference on Principles of Knowledge Representation and Reasoning, pp. 145\u2013154. AAAI Press (2016)"},{"key":"1_CR24","unstructured":"Lee, J., Yang, Z.: LPMLN, weak constraints, and P-log. In: Singh, S., Markovitch, S. (eds.) Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, San Francisco, California, USA, 4\u20139 February 2017, pp. 1170\u20131177. AAAI Press (2017)"},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2013.10.004","volume":"207","author":"Y Lierler","year":"2014","unstructured":"Lierler, Y.: Relating constraint answer set programming languages and algorithms. Artif. Intell. 207, 1\u201322 (2014). https:\/\/doi.org\/10.1016\/j.artint.2013.10.004","journal-title":"Artif. Intell."},{"issue":"1","key":"1_CR26","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1017\/S1471068421000478","volume":"23","author":"Y Lierler","year":"2023","unstructured":"Lierler, Y.: Constraint answer set programming: integrational and translational (or smt-based) approaches. Theory Pract. Logic Program. 23(1), 195\u2013225 (2023). https:\/\/doi.org\/10.1017\/S1471068421000478","journal-title":"Theory Pract. Logic Program."},{"key":"1_CR27","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/j.ijar.2019.12.003","volume":"118","author":"DD Mau\u00e1","year":"2020","unstructured":"Mau\u00e1, D.D., Cozman, F.G.: Complexity results for probabilistic answer set programming. Int. J. Approx. Reason. 118, 133\u2013154 (2020). https:\/\/doi.org\/10.1016\/j.ijar.2019.12.003","journal-title":"Int. J. Approx. Reason."},{"key":"1_CR28","doi-asserted-by":"publisher","unstructured":"Meurer, A., et al.: SymPy: symbolic computing in python. PeerJ Comput. Sci. 3, e103 (2017). https:\/\/doi.org\/10.7717\/peerj-cs.103","DOI":"10.7717\/peerj-cs.103"},{"key":"1_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.artint.2015.06.008","volume":"228","author":"S Michels","year":"2015","unstructured":"Michels, S., Hommersom, A., Lucas, P.J.F., Velikova, M.: A new probabilistic constraint logic programming language based on a generalised distribution semantics. Artif. Intell. 228, 1\u201344 (2015). https:\/\/doi.org\/10.1016\/j.artint.2015.06.008","journal-title":"Artif. Intell."},{"key":"1_CR30","unstructured":"Nguembang Fadja, A., Riguzzi, F., Lamma, E.: Learning the parameters of deep probabilistic logic programs. In: Bellodi, E., Schrijvers, T. (eds.) Probabilistic Logic Programming (PLP 2018). CEUR Workshop Proceedings, vol. 2219, pp. 9\u201314. Sun SITE Central Europe, Aachen (2018)"},{"key":"1_CR31","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/978-3-319-48758-8_24","volume-title":"Logics in Artificial Intelligence","author":"M Nickles","year":"2016","unstructured":"Nickles, M.: A tool for probabilistic reasoning based on logic programming and first-order theories under stable model semantics. In: Michael, L., Kakas, A. (eds.) JELIA 2016. LNCS (LNAI), vol. 10021, pp. 369\u2013384. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-48758-8_24"},{"key":"1_CR32","unstructured":"Nickles, M.: Differentiable SAT\/ASP. In: Bellodi, E., Schrijvers, T. (eds.) Proceedings of the 5th International Workshop on Probabilistic Logic Programming, PLP 2018, co-located with the 28th International Conference on Inductive Logic Programming (ILP 2018), Ferrara, Italy, 1 September 2018, CEUR Workshop Proceedings, vol. 2219, pp. 62\u201374. CEUR-WS.org (2018)"},{"key":"1_CR33","doi-asserted-by":"publisher","unstructured":"Powell, M.J.D.: A direct search optimization method that models the objective and constraint functions by linear interpolation. In: Gomez, S., Hennart, J.P. (eds.) Advances in Optimization and Numerical Analysis, pp. 51\u201367. Springer, Dordrecht (1994). https:\/\/doi.org\/10.1007\/978-94-015-8330-5_4","DOI":"10.1007\/978-94-015-8330-5_4"},{"key":"1_CR34","volume-title":"Foundations of Probabilistic Logic Programming: Languages, semantics, inference and learning","author":"F Riguzzi","year":"2018","unstructured":"Riguzzi, F.: Foundations of Probabilistic Logic Programming: Languages, semantics, inference and learning. River Publishers, Gistrup (2018)"},{"key":"1_CR35","doi-asserted-by":"publisher","unstructured":"Rocha, V.H.N., Gagliardi Cozman, F.: A credal least undefined stable semantics for probabilistic logic programs and probabilistic argumentation. In: Kern-Isberner, G., Lakemeyer, G., Meyer, T. (eds.) Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning, KR 2022, pp. 309\u2013319 (8 2022). https:\/\/doi.org\/10.24963\/kr.2022\/31","DOI":"10.24963\/kr.2022\/31"},{"key":"1_CR36","doi-asserted-by":"publisher","unstructured":"Sato, T.: A statistical learning method for logic programs with distribution semantics. In: Sterling, L. (ed.) ICLP 1995, pp. 715\u2013729. MIT Press, Cambridge (1995). https:\/\/doi.org\/10.7551\/mitpress\/4298.003.0069","DOI":"10.7551\/mitpress\/4298.003.0069"},{"key":"1_CR37","doi-asserted-by":"publisher","unstructured":"Totis, P., De Raedt, L., Kimmig, A.: smProbLog: stable model semantics in problog for probabilistic argumentation. Theory Pract. Logic Program. 1\u201350 (2023). https:\/\/doi.org\/10.1017\/S147106842300008X","DOI":"10.1017\/S147106842300008X"},{"key":"1_CR38","doi-asserted-by":"publisher","unstructured":"Tuckey, D., Russo, A., Broda, K.: PASOCS: a parallel approximate solver for probabilistic logic programs under the credal semantics. arXiv abs\/2105.10908 (2021). https:\/\/doi.org\/10.48550\/ARXIV.2105.10908","DOI":"10.48550\/ARXIV.2105.10908"},{"key":"1_CR39","doi-asserted-by":"publisher","unstructured":"Van Gelder, A., Ross, K., Schlipf, J.S.: Unfounded sets and well-founded semantics for general logic programs. In: Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, PODS 1988, pp. 221\u2013230. Association for Computing Machinery, New York (1988). https:\/\/doi.org\/10.1145\/308386.308444","DOI":"10.1145\/308386.308444"},{"key":"1_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-540-27775-0_30","volume-title":"Logic Programming","author":"J Vennekens","year":"2004","unstructured":"Vennekens, J., Verbaeten, S., Bruynooghe, M.: Logic programs with annotated disjunctions. In: Demoen, B., Lifschitz, V. (eds.) ICLP 2004. LNCS, vol. 3132, pp. 431\u2013445. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-27775-0_30"},{"key":"1_CR41","doi-asserted-by":"publisher","unstructured":"Vieira de Faria, F.H., Gusm\u00e3o, A.C., De Bona, G., Mau\u00e1, D.D., Cozman, F.G.: Speeding up parameter and rule learning for acyclic probabilistic logic programs. Int. J. Approx. Reason. 106, 32\u201350 (2019). https:\/\/doi.org\/10.1016\/j.ijar.2018.12.012","DOI":"10.1016\/j.ijar.2018.12.012"},{"key":"1_CR42","doi-asserted-by":"publisher","unstructured":"Virtanen, P., et al.: SciPy 1.0: fundamental algorithms for scientific computing in python. Nat. Methods 17, 261\u2013272 (2020). https:\/\/doi.org\/10.1038\/s41592-019-0686-2","DOI":"10.1038\/s41592-019-0686-2"},{"key":"1_CR43","unstructured":"Walsh, T.: Stochastic constraint programming. In: Proceedings of the 15th European Conference on Artificial Intelligence, vol. 1, pp. 111\u2013115 (2002)"}],"container-title":["Lecture Notes in Computer Science","Inductive Logic Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49299-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T05:07:02Z","timestamp":1703135222000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49299-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031492983","9783031492990"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49299-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ILP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Inductive Logic Programming","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bari","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"32","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ilp2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/ilp2023.unife.it\/","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":"https:\/\/easychair.org\/","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"18","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":"11","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":"1","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":"61% - 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":"2.89","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":"2.55","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)"}},{"value":"1 late-breaking abstract only for oral presentation (not to be included in the conference proceedings)","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)"}}]}}