{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,5]],"date-time":"2026-06-05T03:48:35Z","timestamp":1780631315974,"version":"3.54.1"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319983332","type":"print"},{"value":"9783319983349","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-98334-9_21","type":"book-chapter","created":{"date-parts":[[2018,8,22]],"date-time":"2018-08-22T08:33:14Z","timestamp":1534926794000},"page":"312-327","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["MLIC: A MaxSAT-Based Framework for Learning Interpretable Classification Rules"],"prefix":"10.1007","author":[{"given":"Dmitry","family":"Malioutov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kuldeep S.","family":"Meel","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,8,23]]},"reference":[{"issue":"6","key":"21_CR1","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1016\/0950-7051(96)81920-4","volume":"8","author":"R Andrews","year":"1995","unstructured":"Andrews, R., Diederich, J., Tickle, A.: Survey and critique of techniques for extracting rules from trained artificial neural networks. Knowl. Based Syst. 8(6), 373\u2013389 (1995)","journal-title":"Knowl. Based Syst."},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"van Beek, P., Hoffmann, H.F.: Machine learning of Bayesian networks using constraint programming. In: Proceedings of CP, pp. 429\u2013445 (2015)","DOI":"10.1007\/978-3-319-23219-5_31"},{"key":"21_CR3","unstructured":"Berg, J., Saikko, P., J\u00e4rvisalo, M.: Improving the effectiveness of sat-based preprocessing for MaxSAT. In: Proceedings of IJCAI (2015)"},{"key":"21_CR4","first-page":"269","volume":"25","author":"D Bertsimas","year":"2012","unstructured":"Bertsimas, D., Chang, A., Rudin, C.: An integer optimization approach to associative classification. Adv. Neur. Inf. Process. Syst. 25, 269\u2013277 (2012)","journal-title":"Adv. Neur. Inf. Process. Syst."},{"key":"21_CR5","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). \n                      https:\/\/doi.org\/10.1007\/978-3-642-04244-7_16"},{"key":"21_CR6","unstructured":"Blake, C., Merz, C.J.: \n                      \n                        \n                      \n                      $$\\{$$\n                    UCI\n                      \n                        \n                      \n                      $$\\}$$\n                     repository of machine learning databases (1998)"},{"issue":"2","key":"21_CR7","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1109\/69.842268","volume":"12","author":"E Boros","year":"2000","unstructured":"Boros, E., Hammer, P., Ibaraki, T., Kogan, A., Mayoraz, E., Muchnik, I.: An implementation of logical analysis of data. IEEE Trans. Knowl. Data Eng. 12(2), 292\u2013306 (2000)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"21_CR8","volume-title":"Classification and Regression Trees","author":"L Breiman","year":"1984","unstructured":"Breiman, L., Friedman, J., Stone, C., Olshen, R.: Classification and Regression Trees. CRC Press, Boca Raton (1984)"},{"issue":"4","key":"21_CR9","first-page":"261","volume":"3","author":"P Clark","year":"1989","unstructured":"Clark, P., Niblett, T.: The CN2 induction algorithm. Mach. Learn. 3(4), 261\u2013283 (1989)","journal-title":"Mach. Learn."},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/B978-1-55860-377-6.50023-2","volume-title":"Machine Learning Proceedings 1995","author":"William W. Cohen","year":"1995","unstructured":"Cohen, W.W.: Fast effective rule induction. In: Proceedings of International Conference on Machine Learning, pp. 115\u2013123. Tahoe City, CA, July 1995"},{"key":"21_CR11","unstructured":"Cohen, W.W., Singer, Y.: A simple, fast, and effective rule learner. In: Proceedings of National Conference on Artificial Intelligence, pp. 335\u2013342, Orlando, FL. July 1999"},{"key":"21_CR12","unstructured":"Craven, M.W., Shavlik, J.W.: Extracting tree-structured representations of trained networks. In: Proceedings of NIPS, pp. 24\u201330 (1996)"},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-3-642-23786-7_19","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"Jessica Davies","year":"2011","unstructured":"Davies, J., Bacchus, F.: Solving MaxSAT by solving a sequence of simpler sat instances. In: Proceedings of CP, pp. 225\u2013239 (2011)"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"De Raedt, L., Guns, T., Nijssen, S.: Constraint programming for itemset mining. In: Proceedings of KDD, pp. 204\u2013212 (2008)","DOI":"10.1145\/1401890.1401919"},{"issue":"1","key":"21_CR15","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1007\/s10618-010-0177-7","volume":"21","author":"K Dembczy\u0144ski","year":"2010","unstructured":"Dembczy\u0144ski, K., Kot\u0142owski, W., S\u0142owi\u0144ski, R.: Ender: a statistical framework for boosting decision rules. Data Mining Knowl. Discov. 21(1), 52\u201390 (2010)","journal-title":"Data Mining Knowl. Discov."},{"key":"21_CR16","unstructured":"Emad, A., Varshney, K.R., Malioutov, D.M.: A semiquantitative group testing approach for learning interpretable clinical prediction rules. In: Proceedings of Signal Process. Adapt. Sparse Struct. Repr. Workshop, Cambridge, UK (2015)"},{"issue":"1","key":"21_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2594473.2594475","volume":"15","author":"A Freitas","year":"2014","unstructured":"Freitas, A.: Comprehensible classification models: a position paper. ACM SIGKDD Explor. Newsl. 15(1), 1\u201310 (2014)","journal-title":"ACM SIGKDD Explor. Newsl."},{"issue":"3","key":"21_CR18","doi-asserted-by":"publisher","first-page":"916","DOI":"10.1214\/07-AOAS148","volume":"2","author":"JH Friedman","year":"2008","unstructured":"Friedman, J.H., Popescu, B.E.: Predictive learning via rule ensembles. Ann. Appl. Stat. 2(3), 916\u2013954 (2008)","journal-title":"Ann. Appl. Stat."},{"key":"21_CR19","unstructured":"Jawanpuria, P., Jagarlapudi, S.N., Ramakrishnan, G.: Efficient rule ensemble learning using hierarchical kernels. In: Proceedings of ICML (2011)"},{"key":"21_CR20","unstructured":"Letham, B., Rudin, C., McCormick, T.H., Madigan, D.: Building interpretable classifiers with rules using Bayesian analysis. Technical report 609, Department of Statistics. University of Washington, December 2012"},{"key":"21_CR21","unstructured":"Malioutov, D.M., Varshney, K.R.: Exact rule learning via Boolean compressed sensing. In: Proceedings of ICML, pp. 765\u2013773 (2013)"},{"key":"21_CR22","unstructured":"Marchand, M., Shawe-Taylor, J.: The set covering machine. J. Mach. Learn. Res. 3(Dec), 723\u2013746 (2002)"},{"key":"21_CR23","doi-asserted-by":"crossref","unstructured":"Nijssen, S., Guns, T., De Raedt, L.: Correlated itemset mining in ROC space: a constraint programming approach. In: KDD, pp. 647\u2013656. ACM (2009)","DOI":"10.1145\/1557019.1557092"},{"key":"21_CR24","first-page":"38","volume-title":"C4.5: Programming for Machine Learning","author":"JR Quinlan","year":"1993","unstructured":"Quinlan, J.R.: C4.5: Programming for Machine Learning, p. 38. Morgan Kauffmann, San Francisco (1993)"},{"issue":"3","key":"21_CR25","first-page":"229","volume":"2","author":"RL Rivest","year":"1987","unstructured":"Rivest, R.L.: Learning decision lists. Mach. Learn. 2(3), 229\u2013246 (1987)","journal-title":"Mach. Learn."},{"issue":"2\u20133","key":"21_CR26","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s10994-007-5034-6","volume":"70","author":"U R\u00fcckert","year":"2008","unstructured":"R\u00fcckert, U., Kramer, S.: Margin-based first-order rule learning. Mach. Learn. 70(2\u20133), 189\u2013206 (2008)","journal-title":"Mach. Learn."},{"key":"21_CR27","unstructured":"Valiant, L.G.: Learning disjunctions of conjunctions. In: Proceedings of International Joint Conference on Artificial Intelligence, pp. 560\u2013566. Los Angeles, CA, August 1985"},{"key":"21_CR28","unstructured":"Varshney, K.R.: Data science of the people, for the people, by the people: a viewpoint on an emerging dichotomy. In: Proceedings of Data for Good Exchange Conference (2015)"},{"key":"21_CR29","doi-asserted-by":"crossref","unstructured":"Wang, T., Rudin, C., Doshi-Velez, F., Liu, Y., Klampfl, E., MacNeille, P.: Or\u2019s of And\u2019s for interpretable classification, with application to context-aware recommender systems. arXiv preprint \n                      arXiv:1504.07614\n                      \n                     (2015)","DOI":"10.1109\/ICDM.2016.0171"},{"key":"21_CR30","doi-asserted-by":"crossref","unstructured":"Wang, T., Rudin, C., Liu, Y., Klampfl, E., MacNeille, P.: Bayesian Or\u2019s of And\u2019s for interpretable classification with application to context aware recommender systems (2015)","DOI":"10.1109\/ICDM.2016.0171"}],"updated-by":[{"DOI":"10.1007\/978-3-319-98334-9_49","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2019,2,13]],"date-time":"2019-02-13T00:00:00Z","timestamp":1550016000000}}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-98334-9_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T04:33:13Z","timestamp":1558326793000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-98334-9_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319983332","9783319983349"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-98334-9_21","relation":{"correction":[{"id-type":"doi","id":"10.1007\/978-3-319-98334-9_49","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"23 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"13 February 2019","order":2,"name":"change_date","label":"Change Date","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Correction","order":3,"name":"change_type","label":"Change Type","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"In the original version of this chapter there was a typing error in the family name of the first author. This has now been corrected.","order":4,"name":"change_details","label":"Change Details","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":"Lille","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":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cp2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cp2018.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"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"114","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"41","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"9","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"36% - 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"}},{"value":"3,85","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"3,75","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}