{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T16:52:52Z","timestamp":1770223972447,"version":"3.49.0"},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100002666","name":"Aalto-Yliopisto","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002666","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3041040","type":"journal-article","created":{"date-parts":[[2020,11,27]],"date-time":"2020-11-27T20:23:51Z","timestamp":1606508631000},"page":"218180-218185","source":"Crossref","is-referenced-by-count":13,"title":["Learning Explainable Decision Rules via Maximum Satisfiability"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0525-4344","authenticated-orcid":false,"given":"Henrik E. C.","family":"Cao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0708-1830","authenticated-orcid":false,"given":"Riku","family":"Sarlin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7538-0990","authenticated-orcid":false,"given":"Alexander","family":"Jung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/MLSP.2016.7738856"},{"key":"ref11","first-page":"765","article-title":"Exact rule learning via Boolean compressed sensing","author":"malioutov","year":"2013","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref12","doi-asserted-by":"crossref","first-page":"627","DOI":"10.1007\/978-3-319-94205-6_41","article-title":"A SAT-based approach to learn explainable decision sets","author":"ignatiev","year":"2018","journal-title":"Automated Reasoning - Lecture Notes in Computer Science"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-98334-9_21"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/3306618.3314283"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF00058680"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939874"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1992.4.6.888"},{"key":"ref18","first-page":"759","article-title":"Locally weighted learning","author":"atkeson","year":"2017","journal-title":"Encyclopedia of Machine Learning and Data Mining"},{"key":"ref19","first-page":"717","article-title":"August. Lazy decision trees","volume":"1","author":"friedman","year":"1996","journal-title":"Proc AAAI\/IAAI"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.23919\/MIPRO.2018.8400040"},{"key":"ref27","author":"langley","year":"1996","journal-title":"Elements of Machine Learning"},{"key":"ref3","article-title":"What do we need to build explainable AI systems for the medical domain?","author":"holzinger","year":"2017","journal-title":"arXiv 1712 09923"},{"key":"ref6","year":"2020","journal-title":"White Paper on artificial intelligence A European approach to excellence and trust"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2011.01.039"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939778"},{"key":"ref7","year":"2016","journal-title":"Consolidated Text Regulation (EU) 2016\/679 of the European Parliament and of the Council of 27 Apr 2016 on the Protection of Natural Persons With Regard to the Processing of Personal Data and on the Free Movement of Such Data and Repealing Directive 95\/46\/EC (General Data Protection Regulation) (Text With EEA Relevance)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2594473.2594475"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-54024-5_5"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2870052"},{"key":"ref20","first-page":"1085","article-title":"Algorithms for direct 0–1 loss optimization in binary classification","author":"nguyen","year":"2013","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-2312(02)00632-X"},{"key":"ref21","first-page":"181","article-title":"Efficient SAT-based encodings of conditional cardinality constraints","author":"boudane","year":"2018","journal-title":"Proc LPAR"},{"key":"ref24","author":"breiman","year":"1984","journal-title":"Classification and Regression Trees"},{"key":"ref23","first-page":"11","author":"piotrow","year":"2019","journal-title":"UWrMaxSat-a new MiniSat+?based solver"},{"key":"ref26","author":"eibe","year":"2016","journal-title":"The WEKA Workbench Online Appendix for Data Mining Practical Machine Learning Tools and Techniques"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-377-6.50023-2"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09272729.pdf?arnumber=9272729","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,25]],"date-time":"2022-01-25T22:59:57Z","timestamp":1643151597000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9272729\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3041040","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}