{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T11:17:15Z","timestamp":1790680635277,"version":"4.1.0"},"publisher-location":"Cham","reference-count":67,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030584740","type":"print"},{"value":"9783030584757","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"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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-58475-7_49","type":"book-chapter","created":{"date-parts":[[2020,9,6]],"date-time":"2020-09-06T20:02:35Z","timestamp":1599422555000},"page":"846-867","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Towards Formal Fairness in Machine Learning"],"prefix":"10.1007","author":[{"given":"Alexey","family":"Ignatiev","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin C.","family":"Cooper","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohamed","family":"Siala","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Emmanuel","family":"Hebrard","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joao","family":"Marques-Silva","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,9,2]]},"reference":[{"key":"49_CR1","unstructured":"Adebayo, J.A.: FairML: ToolBox for diagnosing bias in predictive modeling. Master\u2019s thesis, Massachusetts Institute of Technology (2016)"},{"key":"49_CR2","unstructured":"Adebayo, J.A.: FairML: auditing black-box predictive models (2017)"},{"key":"49_CR3","unstructured":"A\u00efvodji, U., Arai, H., Fortineau, O., Gambs, S., Hara, S., Tapp, A.: Fairwashing: the risk of rationalization. In: ICML, pp. 161\u2013170 (2019)"},{"key":"49_CR4","unstructured":"A\u00efvodji, U., Ferry, J., Gambs, S., Huguet, M., Siala, M.: Learning fair rule lists. CoRR abs\/1909.03977 (2019). http:\/\/arxiv.org\/abs\/1909.03977"},{"key":"49_CR5","doi-asserted-by":"crossref","unstructured":"Angelino, E., Larus-Stone, N., Alabi, D., Seltzer, M., Rudin, C.: Learning certifiably optimal rule lists for categorical data. J. Mach. Learn. Res. 18, 234:1\u2013234:78 (2017)","DOI":"10.1145\/3097983.3098047"},{"key":"49_CR6","unstructured":"Angwin, J., Larson, J., Mattu, S., Kirchner, L.: Machine bias. propublica.org, May 2016. http:\/\/tiny.cc\/a3b3iz"},{"key":"49_CR7","doi-asserted-by":"publisher","unstructured":"Berk, R., Heidari, H., Jabbari, S., Kearns, M., Roth, A.: Fairness in criminal justice risk assessments: the state of the art. Sociol. Methods Res. (2017). https:\/\/doi.org\/10.1177\/0049124118782533","DOI":"10.1177\/0049124118782533"},{"key":"49_CR8","unstructured":"Berkman, N.C., Sandholm, T.W.: What should be minimized in a decision tree: a re-examination. Department of Computer Science (1995)"},{"key":"49_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-04244-7_16","volume-title":"Principles and Practice of Constraint Programming - CP 2009","author":"C Bessiere","year":"2009","unstructured":"Bessiere, C., Hebrard, E., O\u2019Sullivan, B.: Minimising decision tree size as combinatorial optimisation. In: Gent, I.P. (ed.) CP 2009. LNCS, vol. 5732, pp. 173\u2013187. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-04244-7_16"},{"key":"49_CR10","unstructured":"Biere, A., Heule, M., van Maaren, H., Walsh, T. (eds.): Handbook of Satisfiability, Frontiers in Artificial Intelligence and Applications, vol. 185. IOS Press (2009)"},{"key":"49_CR11","doi-asserted-by":"crossref","unstructured":"Bird, S., Hutchinson, B., Kenthapadi, K., Kiciman, E., Mitchell, M.: Fairness-aware machine learning: practical challenges and lessons learned. In: KDD, pp. 3205\u20133206 (2019)","DOI":"10.1145\/3289600.3291383"},{"key":"49_CR12","doi-asserted-by":"publisher","unstructured":"Cardelli, L., Kwiatkowska, M., Laurenti, L., Paoletti, N., Patane, A., Wicker, M.: Statistical guarantees for the robustness of Bayesian neural networks. In: Kraus, S. (ed.) Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, IJCAI 2019, Macao, China, 10\u201316 August 2019, pp. 5693\u20135700. ijcai.org (2019). https:\/\/doi.org\/10.24963\/ijcai.2019\/789","DOI":"10.24963\/ijcai.2019\/789"},{"key":"49_CR13","doi-asserted-by":"crossref","unstructured":"Chen, T., Guestrin, C.: XGBoost: a scalable tree boosting system. In: KDD, pp. 785\u2013794 (2016)","DOI":"10.1145\/2939672.2939785"},{"issue":"2","key":"49_CR14","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1089\/big.2016.0047","volume":"5","author":"A Chouldechova","year":"2017","unstructured":"Chouldechova, A.: Fair prediction with disparate impact: a study of bias in recidivism prediction instruments. Big Data 5(2), 153\u2013163 (2017)","journal-title":"Big Data"},{"issue":"5","key":"49_CR15","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1145\/3376898","volume":"63","author":"A Chouldechova","year":"2020","unstructured":"Chouldechova, A., Roth, A.: A snapshot of the frontiers of fairness in machine learning. Commun. ACM 63(5), 82\u201389 (2020)","journal-title":"Commun. ACM"},{"key":"49_CR16","doi-asserted-by":"crossref","unstructured":"Corbett-Davies, S., Pierson, E., Feller, A., Goel, S., Huq, A.: Algorithmic decision making and the cost of fairness. In: KDD 2017, pp. 797\u2013806 (2017)","DOI":"10.1145\/3097983.3098095"},{"key":"49_CR17","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. MIT Press (2009). http:\/\/mitpress.mit.edu\/books\/introduction-algorithms"},{"issue":"1","key":"49_CR18","first-page":"2349","volume":"14","author":"J Demsar","year":"2013","unstructured":"Demsar, J., et al.: Orange: data mining toolbox in python. J. Mach. Learn. Res. 14(1), 2349\u20132353 (2013)","journal-title":"J. Mach. Learn. Res."},{"key":"49_CR19","doi-asserted-by":"crossref","unstructured":"Dressel, J., Farid, H.: The accuracy, fairness, and limits of predicting recidivism. Sci. Adv. 4(1), eaao5580 (2018)","DOI":"10.1126\/sciadv.aao5580"},{"key":"49_CR20","doi-asserted-by":"crossref","unstructured":"Dwork, C., Hardt, M., Pitassi, T., Reingold, O., Zemel, R.: Fairness through awareness. In: ITCS, pp. 214\u2013226 (2012)","DOI":"10.1145\/2090236.2090255"},{"key":"49_CR21","series-title":"Lecture Notes in Computer Science","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":"N E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol. 2919, pp. 502\u2013518. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24605-3_37"},{"key":"49_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-319-68167-2_19","volume-title":"Automated Technology for Verification and Analysis","author":"R Ehlers","year":"2017","unstructured":"Ehlers, R.: Formal verification of piece-wise linear feed-forward neural networks. In: D\u2019Souza, D., Narayan Kumar, K. (eds.) ATVA 2017. LNCS, vol. 10482, pp. 269\u2013286. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-68167-2_19"},{"key":"49_CR23","unstructured":"European Union High-Level Expert Group on Artificial Intelligence: Ethics guidelines for trustworthy AI, April 2019. https:\/\/ec.europa.eu\/digital-single-market\/en\/news\/ethics-guidelines-trustworthy-ai"},{"key":"49_CR24","doi-asserted-by":"crossref","unstructured":"Feldman, M., Friedler, S.A., Moeller, J., Scheidegger, C., Venkatasubramanian, S.: Certifying and removing disparate impact. In: KDD, pp. 259\u2013268. ACM (2015)","DOI":"10.1145\/2783258.2783311"},{"key":"49_CR25","unstructured":"Friedler, S.A., Scheidegger, C., Venkatasubramanian, S.: On the (im)possibility of fairness. CoRR abs\/1609.07236 (2016). http:\/\/arxiv.org\/abs\/1609.07236"},{"key":"49_CR26","doi-asserted-by":"crossref","unstructured":"Friedler, S.A., Scheidegger, C., Venkatasubramanian, S., Choudhary, S., Hamilton, E.P., Roth, D.: A comparative study of fairness-enhancing interventions in machine learning. In: FAT, pp. 329\u2013338 (2019)","DOI":"10.1145\/3287560.3287589"},{"key":"49_CR27","doi-asserted-by":"crossref","unstructured":"Galhotra, S., Brun, Y., Meliou, A.: Fairness testing: testing software for discrimination. In: FSE, pp. 498\u2013510 (2017)","DOI":"10.1145\/3106237.3106277"},{"key":"49_CR28","doi-asserted-by":"crossref","unstructured":"Garg, S., Perot, V., Limtiaco, N., Taly, A., Chi, E.H., Beutel, A.: Counterfactual fairness in text classification through robustness. In: AIES, pp. 219\u2013226 (2019)","DOI":"10.1145\/3306618.3317950"},{"key":"49_CR29","unstructured":"Gario, M., Micheli, A.: PySMT: a solver-agnostic library for fast prototyping of SMT-based algorithms. In: SMT Workshop (2015)"},{"key":"49_CR30","doi-asserted-by":"crossref","unstructured":"Ghosh, B., Meel, K.S.: IMLI: an incremental framework for MaxSAT-based learning of interpretable classification rules. In: AIES, pp. 203\u2013210 (2019)","DOI":"10.1145\/3306618.3314283"},{"key":"49_CR31","unstructured":"Grgic-Hlaca, N., Zafar, M.B., Gummadi, K.P., Weller, A.: The case for process fairness in learning: feature selection for fair decision making. In: NIPS Symposium on Machine Learning and the Law (2016)"},{"key":"49_CR32","unstructured":"Han, J., Kamber, M., Pei, J.: Data Mining: Concepts and Techniques, 3rd edn. Morgan Kaufmann (2012)"},{"key":"49_CR33","unstructured":"Hardt, M., Price, E., Srebro, N.: Equality of opportunity in supervised learning. In: Lee, D.D., Sugiyama, M., von Luxburg, U., Guyon, I., Garnett, R. (eds.) Advances in Neural Information Processing Systems 29, pp. 3315\u20133323 (2016). http:\/\/papers.nips.cc\/paper\/6374-equality-of-opportunity-in-supervised-learning"},{"key":"49_CR34","doi-asserted-by":"crossref","unstructured":"Holstein, K., Vaughan, J.W., Daum\u00e9 III, H., Dud\u00edk, M., Wallach, H.M.: Improving fairness in machine learning systems: what do industry practitioners need? In: CHI, p. 600 (2019)","DOI":"10.1145\/3290605.3300830"},{"key":"49_CR35","doi-asserted-by":"crossref","unstructured":"Hu, H., Siala, M., Hebrard, E., Huguet, M.J.: Learning optimal decision trees with MaxSAT and its integration in AdaBoost. In: IJCAI, pp. 1170\u20131176 (2020)","DOI":"10.24963\/ijcai.2020\/163"},{"key":"49_CR36","unstructured":"Hu, X., Rudin, C., Seltzer, M.: Optimal sparse decision trees. In: NeurIPS, pp. 7265\u20137273 (2019)"},{"key":"49_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/978-3-319-63387-9_1","volume-title":"Computer Aided Verification","author":"X Huang","year":"2017","unstructured":"Huang, X., Kwiatkowska, M., Wang, S., Wu, M.: Safety verification of deep neural networks. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10426, pp. 3\u201329. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63387-9_1"},{"key":"49_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/978-3-319-94144-8_26","volume-title":"Theory and Applications of Satisfiability Testing \u2013 SAT 2018","author":"A Ignatiev","year":"2018","unstructured":"Ignatiev, A., Morgado, A., Marques-Silva, J.: PySAT: a python toolkit for prototyping with SAT oracles. In: Beyersdorff, O., Wintersteiger, C.M. (eds.) SAT 2018. LNCS, vol. 10929, pp. 428\u2013437. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94144-8_26"},{"key":"49_CR39","doi-asserted-by":"crossref","unstructured":"Ignatiev, A., Narodytska, N., Marques-Silva, J.: Abduction-based explanations for machine learning models. In: AAAI, pp. 1511\u20131519 (2019)","DOI":"10.1609\/aaai.v33i01.33011511"},{"key":"49_CR40","unstructured":"Ignatiev, A., Narodytska, N., Marques-Silva, J.: On validating, repairing and refining heuristic ML explanations. CoRR abs\/1907.02509 (2019). http:\/\/arxiv.org\/abs\/1907.02509"},{"key":"49_CR41","doi-asserted-by":"crossref","unstructured":"Ignatiev, A., Pereira, F., Narodytska, N., Marques-Silva, J.: A SAT-based approach to learn explainable decision sets. In: IJCAR, pp. 627\u2013645 (2018)","DOI":"10.1007\/978-3-319-94205-6_41"},{"key":"49_CR42","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/BF01581082","volume":"57","author":"AP Kamath","year":"1992","unstructured":"Kamath, A.P., Karmarkar, N., Ramakrishnan, K.G., Resende, M.G.C.: A continuous approach to inductive inference. Math. Program. 57, 215\u2013238 (1992)","journal-title":"Math. Program."},{"key":"49_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-319-63387-9_5","volume-title":"Computer Aided Verification","author":"G Katz","year":"2017","unstructured":"Katz, G., Barrett, C., Dill, D.L., Julian, K., Kochenderfer, M.J.: Reluplex: an efficient SMT solver for verifying deep neural networks. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10426, pp. 97\u2013117. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63387-9_5"},{"key":"49_CR44","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/978-3-030-25540-4_26","volume-title":"Computer Aided Verification","author":"G Katz","year":"2019","unstructured":"Katz, G., et al.: The marabou framework for verification and analysis of deep neural networks. In: Dillig, I., Tasiran, S. (eds.) CAV 2019. LNCS, vol. 11561, pp. 443\u2013452. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25540-4_26"},{"key":"49_CR45","unstructured":"Kilbertus, N., Rojas-Carulla, M., Parascandolo, G., Hardt, M., Janzing, D., Sch\u00f6lkopf, B.: Avoiding discrimination through causal reasoning. In: NeurIPS, pp. 656\u2013666 (2017)"},{"key":"49_CR46","unstructured":"Kleinberg, J.M., Mullainathan, S., Raghavan, M.: Inherent trade-offs in the fair determination of risk scores. In: 8th Innovations in Theoretical Computer Science Conference, ITCS 2017, Berkeley, CA, USA, 9\u201311 January 2017, pp. 43:1\u201343:23 (2017)"},{"key":"49_CR47","unstructured":"Kohavi, R.: Scaling up the accuracy of Naive-Bayes classifiers: a decision-tree hybrid. In: KDD, pp. 202\u2013207 (1996)"},{"key":"49_CR48","unstructured":"Kusner, M.J., Loftus, J.R., Russell, C., Silva, R.: Counterfactual fairness. In: NeurIPS, pp. 4066\u20134076 (2017)"},{"key":"49_CR49","doi-asserted-by":"crossref","unstructured":"Lakkaraju, H., Bach, S.H., Leskovec, J.: Interpretable decision sets: a joint framework for description and prediction. In: KDD, pp. 1675\u20131684 (2016)","DOI":"10.1145\/2939672.2939874"},{"key":"49_CR50","unstructured":"Leofante, F., Narodytska, N., Pulina, L., Tacchella, A.: Automated verification of neural networks: advances, challenges and perspectives. CoRR abs\/1805.09938 (2018). http:\/\/arxiv.org\/abs\/1805.09938"},{"key":"49_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1007\/978-3-319-98334-9_21","volume-title":"Principles and Practice of Constraint Programming","author":"D Maliotov","year":"2018","unstructured":"Maliotov, D., Meel, K.S.: MLIC: a MaxSAT-based framework for learning interpretable classification rules. In: Hooker, J. (ed.) CP 2018. LNCS, vol. 11008, pp. 312\u2013327. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-98334-9_21"},{"key":"49_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/978-3-540-78800-3_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"L de Moura","year":"2008","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: an efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24"},{"key":"49_CR53","doi-asserted-by":"crossref","unstructured":"Nabi, R., Shpitser, I.: Fair inference on outcomes. In: AAAI, pp. 1931\u20131940 (2018)","DOI":"10.1609\/aaai.v32i1.11553"},{"key":"49_CR54","unstructured":"Narayanan, A.: Translation tutorial: 21 fairness definitions and their politics. In: FAT (2018)"},{"key":"49_CR55","doi-asserted-by":"crossref","unstructured":"Narodytska, N.: Formal analysis of deep binarized neural networks. In: IJCAI, pp. 5692\u20135696 (2018)","DOI":"10.24963\/ijcai.2018\/811"},{"key":"49_CR56","doi-asserted-by":"crossref","unstructured":"Narodytska, N., Ignatiev, A., Pereira, F., Marques-Silva, J.: Learning optimal decision trees with SAT. In: IJCAI, pp. 1362\u20131368 (2018)","DOI":"10.24963\/ijcai.2018\/189"},{"key":"49_CR57","doi-asserted-by":"crossref","unstructured":"Narodytska, N., Kasiviswanathan, S.P., Ryzhyk, L., Sagiv, M., Walsh, T.: Verifying properties of binarized deep neural networks. In: AAAI, pp. 6615\u20136624 (2018)","DOI":"10.1609\/aaai.v32i1.12206"},{"key":"49_CR58","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., et al.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"49_CR59","unstructured":"du Pin Calmon, F., Wei, D., Vinzamuri, B., Ramamurthy, K.N., Varshney, K.R.: Optimized pre-processing for discrimination prevention. In: NeurIPS, pp. 3992\u20134001 (2017)"},{"key":"49_CR60","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-642-14295-6_24","volume-title":"Computer Aided Verification","author":"L Pulina","year":"2010","unstructured":"Pulina, L., Tacchella, A.: An abstraction-refinement approach to verification of artificial neural networks. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol. 6174, pp. 243\u2013257. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-14295-6_24"},{"key":"49_CR61","doi-asserted-by":"crossref","unstructured":"Ruan, W., Huang, X., Kwiatkowska, M.: Reachability analysis of deep neural networks with provable guarantees. In: IJCAI, pp. 2651\u20132659 (2018)","DOI":"10.24963\/ijcai.2018\/368"},{"key":"49_CR62","doi-asserted-by":"crossref","unstructured":"Shih, A., Choi, A., Darwiche, A.: A symbolic approach to explaining Bayesian network classifiers. In: IJCAI, pp. 5103\u20135111 (2018)","DOI":"10.24963\/ijcai.2018\/708"},{"key":"49_CR63","unstructured":"Supreme Court of the United States: Ricci v. DeStefano. U.S. 557, 174 (2009)"},{"key":"49_CR64","doi-asserted-by":"crossref","unstructured":"Verma, S., Rubin, J.: Fairness definitions explained. In: FairWare@ICSE, pp. 1\u20137 (2018)","DOI":"10.1145\/3194770.3194776"},{"key":"49_CR65","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-319-59776-8_8","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"S Verwer","year":"2017","unstructured":"Verwer, S., Zhang, Y.: Learning decision trees with flexible constraints and objectives using integer optimization. In: Salvagnin, D., Lombardi, M. (eds.) CPAIOR 2017. LNCS, vol. 10335, pp. 94\u2013103. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59776-8_8"},{"key":"49_CR66","doi-asserted-by":"crossref","unstructured":"Verwer, S., Zhang, Y.: Learning optimal classification trees using a binary linear program formulation. In: AAAI, pp. 1625\u20131632 (2019)","DOI":"10.1609\/aaai.v33i01.33011624"},{"key":"49_CR67","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1016\/j.tcs.2019.05.046","volume":"807","author":"M Wu","year":"2020","unstructured":"Wu, M., Wicker, M., Ruan, W., Huang, X., Kwiatkowska, M.: A game-based approximate verification of deep neural networks with provable guarantees. Theor. Comput. Sci. 807, 298\u2013329 (2020). https:\/\/doi.org\/10.1016\/j.tcs.2019.05.046","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-58475-7_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,16]],"date-time":"2022-11-16T22:57:02Z","timestamp":1668639422000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58475-7_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030584740","9783030584757"],"references-count":67,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58475-7_49","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":"2 September 2020","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":"Louvain-la-Neuve","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgium","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cp2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cp2020.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":"122","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":"55","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":"45% - 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.13","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":"3.47","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","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)"}}]}}