{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:45:12Z","timestamp":1742939112715,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031264184"},{"type":"electronic","value":"9783031264191"}],"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-26419-1_25","type":"book-chapter","created":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T00:24:57Z","timestamp":1679876697000},"page":"410-425","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["SaDe: Learning Models that\u00a0Provably Satisfy Domain Constraints"],"prefix":"10.1007","author":[{"given":"Kshitij","family":"Goyal","sequence":"first","affiliation":[]},{"given":"Sebastijan","family":"Dumancic","sequence":"additional","affiliation":[]},{"given":"Hendrik","family":"Blockeel","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,3,17]]},"reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Aghaei, S., Azizi, M.J., Vayanos, P.: Learning optimal and fair decision trees for non-discriminative decision-making. In: AAAI (2019)","DOI":"10.1609\/aaai.v33i01.33011418"},{"key":"25_CR2","unstructured":"Barocas, S., Hardt, M., Narayanan, A.: NIPS 2017 tutorial on fairness in machine learning, 1 (2017)"},{"key":"25_CR3","unstructured":"Berg, O.J., Hyttinen, A.J., J\u00e4rvisalo, M.J., et al.: Applications of MaxSAT in data analysis. In: Pragmatics of SAT (2019)"},{"key":"25_CR4","doi-asserted-by":"crossref","unstructured":"Berner, J., Grohs, P., Kutyniok, G., Petersen, P.: The modern mathematics of deep learning. arXiv preprint arXiv:2105.04026 (2021)","DOI":"10.1017\/9781009025096.002"},{"key":"25_CR5","unstructured":"Chen, H., Zhang, H., Si, S., Li, Y., Boning, D., Hsieh, C.J.: Robustness verification of tree-based models. In: NeurIPS (2019)"},{"key":"25_CR6","unstructured":"Cussens, J.: Bayesian network learning by compiling to weighted MAX-SAT. arXiv preprint arXiv:1206.3244 (2012)"},{"key":"25_CR7","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":"25_CR8","unstructured":"Demirovi\u0107, E., et al.: MurTree: optimal classification trees via dynamic programming and search. arXiv preprint arXiv:2007.12652 (2020)"},{"key":"25_CR9","unstructured":"Devos, L., Meert, W., Davis, J.: Versatile verification of tree ensembles. In: International Conference on Machine Learning, pp. 2654\u20132664. PMLR (2021)"},{"key":"25_CR10","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.artint.2015.08.011","volume":"244","author":"M Diligenti","year":"2017","unstructured":"Diligenti, M., Gori, M., Sacca, C.: Semantic-based regularization for learning and inference. Artif. Intell. 244, 143\u2013165 (2017)","journal-title":"Artif. Intell."},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Dumancic, S., Meert, W., Goethals, S., Stuyckens, T., Huygen, J., Denies, K.: Automated reasoning and learning for automated payroll management. In: Proceedings of the Thirty-Third Annual Conference on Innovative Applications of Artificial Intelligence (2020)","DOI":"10.1609\/aaai.v35i17.17774"},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Einziger, G., Goldstein, M., Sa\u2019ar, Y., Segall, I.: Verifying robustness of gradient boosted models. In: AAAI (2019)","DOI":"10.1609\/aaai.v33i01.33012446"},{"key":"25_CR13","unstructured":"Fischer, M., Balunovic, M., Drachsler-Cohen, D., Gehr, T., Zhang, C., Vechev, M.: DL2: training and querying neural networks with logic. In: ICML (2019)"},{"key":"25_CR14","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":"25_CR15","unstructured":"Gori, M.: Machine Learning: A Constraint-Based Approach (2017)"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Hoernle, N., Karampatsis, R.M., Belle, V., Gal, K.: MultiplexNet: towards fully satisfied logical constraints in neural networks (2021)","DOI":"10.1609\/aaai.v36i5.20512"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Hu, H., Siala, M., H\u00e9brard, E., Huguet, M.J.: Learning optimal decision trees with MaxSAT and its integration in AdaBoost. In: IJCAI (2020)","DOI":"10.24963\/ijcai.2020\/163"},{"key":"25_CR18","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":"25_CR19","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":"25_CR20","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":"25_CR21","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":"25_CR22","unstructured":"Manhaeve, R., Dumancic, S., Kimmig, A., Demeester, T., De Raedt, L.: DeepProbLog: neural probabilistic logic programming. In: NeurIPS (2018)"},{"key":"25_CR23","unstructured":"Norouzi, M., Collins, M., Johnson, M.A., Fleet, D.J., Kohli, P.: Efficient non-greedy optimization of decision trees. In: Advances in Neural Information Processing Systems, vol. 28 (2015)"},{"key":"25_CR24","unstructured":"Ranise, S., Tinelli, C.: The SMT-LIB standard: version 1.2. Technical report, Department of Computer Science, The University of Iowa (2006)"},{"key":"25_CR25","unstructured":"Rossi, F., Van Beek, P., Walsh, T.: Handbook of Constraint Programming (2006)"},{"key":"25_CR26","unstructured":"Singh, G., Gehr, T., P\u00fcschel, M., Vechev, M.: Boosting robustness certification of neural networks. In: ICLR (2018)"},{"key":"25_CR27","unstructured":"Sivaraman, A., Farnadi, G., Millstein, T., Van den Broeck, G.: Counterexample-guided learning of monotonic neural networks. arXiv preprint arXiv:2006.08852 (2020)"},{"key":"25_CR28","doi-asserted-by":"crossref","unstructured":"Verhaeghe, H., Nijssen, S., Pesant, G., Quimper, C.G., Schaus, P.: Learning optimal decision trees using constraint programming. In: BNAIC\/BENELEARN (2019)","DOI":"10.24963\/ijcai.2020\/662"},{"key":"25_CR29","doi-asserted-by":"crossref","unstructured":"Verwer, S., Zhang, Y.: Learning optimal classification trees using a binary linear program formulation. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 1625\u20131632 (2019)","DOI":"10.1609\/aaai.v33i01.33011624"},{"key":"25_CR30","doi-asserted-by":"crossref","unstructured":"Vos, D., Verwer, S.: Robust optimal classification trees against adversarial examples. arXiv preprint arXiv:2109.03857 (2021)","DOI":"10.1609\/aaai.v36i8.20829"},{"key":"25_CR31","unstructured":"Xu, J., Zhang, Z., Friedman, T., Liang, Y., Van Den Broeck, G.: A semantic loss function for deep learning with symbolic knowledge. In: ICML (2018)"},{"key":"25_CR32","doi-asserted-by":"publisher","first-page":"1251","DOI":"10.1613\/jair.1.12719","volume":"72","author":"J Yu","year":"2021","unstructured":"Yu, J., Ignatiev, A., Stuckey, P.J., Le Bodic, P.: Learning optimal decision sets and lists with SAT. J. Artif. Intell. Res. 72, 1251\u20131279 (2021)","journal-title":"J. Artif. Intell. Res."}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-26419-1_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T00:33:40Z","timestamp":1679877220000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-26419-1_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031264184","9783031264191"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-26419-1_25","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":"17 March 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Grenoble","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2022.ecmlpkdd.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":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"1060","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":"236","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":"22% - 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-4","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-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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"17 demo track papers have been accepted from 28 submissions","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)"}}]}}