Author of the publication

Assessing Heuristic Machine Learning Explanations with Model Counting.

, , , , and . SAT, volume 11628 of Lecture Notes in Computer Science, page 267-278. Springer, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Approximate Counting of Minimal Unsatisfiable Subsets., and . CAV (1), volume 12224 of Lecture Notes in Computer Science, page 439-462. Springer, (2020)Principled network reliability approximation: A counting-based approach., , , and . Reliab. Eng. Syst. Saf., (2019)MLIC: A MaxSAT-Based Framework for Learning Interpretable Classification Rules., and . CP, volume 11008 of Lecture Notes in Computer Science, page 312-327. Springer, (2018)Knowledge Compilation meets Uniform Sampling., , , and . LPAR, volume 57 of EPiC Series in Computing, page 620-636. EasyChair, (2018)Estimating the Size of Union of Sets in Streaming Models., , and . PODS, page 126-137. ACM, (2021)ApproxASP - a Scalable Approximate Answer Set Counter., , , , , and . AAAI, page 5755-5764. AAAI Press, (2022)Counting Maximal Satisfiable Subsets., and . AAAI, page 3651-3660. AAAI Press, (2021)Engineering an Efficient Boolean Functional Synthesis Engine., , , and . ICCAD, page 1-9. IEEE, (2021)"How Biased are Your Features?": Computing Fairness Influence Functions with Global Sensitivity Analysis., , and . FAccT, page 138-148. ACM, (2023)Engineering an Efficient PB-XOR Solver., and . CP, volume 210 of LIPIcs, page 58:1-58:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)