{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/mlic-a-maxsat-based-framework-for-learning","title":"MLIC: A MaxSAT-Based framework for learning interpretable classification rules","arxiv_id":"1812.01843","date":"2018-12-05","proceeding":null,"authors":["Dmitry Malioutov","Kuldeep S. Meel"],"abstract":"The wide adoption of machine learning approaches in the industry, government,\nmedicine and science has renewed the interest in interpretable machine\nlearning: many decisions are too important to be delegated to black-box\ntechniques such as deep neural networks or kernel SVMs. Historically, problems\nof learning interpretable classifiers, including classification rules or\ndecision trees, have been approached by greedy heuristic methods as essentially\nall the exact optimization formulations are NP-hard. Our primary contribution\nis a MaxSAT-based framework, called MLIC, which allows principled search for\ninterpretable classification rules expressible in propositional logic. Our\napproach benefits from the revolutionary advances in the constraint\nsatisfaction community to solve large-scale instances of such problems. In\nexperimental evaluations over a collection of benchmarks arising from practical\nscenarios, we demonstrate its effectiveness: we show that the formulation can\nsolve large classification problems with tens or hundreds of thousands of\nexamples and thousands of features, and to provide a tunable balance of\naccuracy vs. interpretability. Furthermore, we show that in many problems\ninterpretability can be obtained at only a minor cost in accuracy. The primary\nobjective of the paper is to show that recent advances in the MaxSAT literature\nmake it realistic to find optimal (or very high quality near-optimal) solutions\nto large-scale classification problems. The key goal of the paper is to excite\nresearchers in both interpretable classification and in the CP community to\ntake it further and propose richer formulations, and to develop bespoke solvers\nattuned to the problem of interpretable ML.","url_abs":"http://arxiv.org/abs/1812.01843v1","url_pdf":"http://arxiv.org/pdf/1812.01843v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"mlic-a-maxsat-based-framework-for-learning","repo_url":"https://github.com/meelgroup/mlic","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"machine-learning","task_name":"BIG-bench Machine Learning"},{"task_slug":"classification-1","task_name":"Classification"},{"task_slug":"classification","task_name":"General Classification"},{"task_slug":"interpretable-machine-learning","task_name":"Interpretable Machine Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1812.01843","atlas_url":"https://app.syntology.ai/?focus=1812.01843","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1812.01843"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1812.01843\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1812.01843"},"call":"get_concepts_for_paper(arxiv_id=\"1812.01843\")"}],"by_repo":[{"repo":"meelgroup/mlic","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"9df4106cfccb7b952c1e577cf40ba871ed2e0df9ec565a3bb766da4a8fcc1e6b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}