82 citations · 369 across the 63 of their papers we have counts for
4 papers · 1 filter
BOSPHORUS: Bridging ANF and CNF Solvers
Davin Choo, Mate Soos, Kian Ming A. Chai +1
Algebraic Normal Form (ANF) and Conjunctive Normal Form (CNF) are commonly used to encode problems in Boolean algebra. ANFs are typically solved via Gr"obner basis algorithms, ofte…
MLIC: A MaxSAT-Based framework for learning interpretable classification rules
Dmitry Malioutov, Kuldeep S. Meel
The wide adoption of machine learning approaches in the industry, government, medicine and science has renewed the interest in interpretable machine learning: many decisions are to…
Constrained Counting and Sampling: Bridging the Gap between Theory and Practice
Kuldeep S. Meel
Constrained counting and sampling are two fundamental problems in Computer Science with numerous applications, including network reliability, privacy, probabilistic reasoning, and…
Principled Network Reliability Approximation: A Counting-Based Approach
R. Paredes, L. Duenas-Osorio, K. S. Meel +1
As engineered systems expand, become more interdependent, and operate in real-time, reliability assessment is indispensable to support investment and decision making. However, netw…