| Publication | Date of Publication | Type |
|---|
On almost-uniform generation of SAT solutions: the power of 3-wise independent hashing
| 2024-12-06 | Paper |
Support size estimation: the power of conditioning
| 2024-12-03 | Paper |
Explaining SAT solving using causal reasoning
| 2024-11-26 | Paper |
Approximate model counting: is SAT oracle more powerful than NP oracle?
| 2024-11-14 | Paper |
Hashing-based approximate counting of minimal unsatisfiable subsets
Formal Methods in System Design | 2024-11-04 | Paper |
Rounding meets approximate model counting
| 2024-01-12 | Paper |
Model counting meets \(F_0\) estimation
ACM Transactions on Database Systems | 2023-11-29 | Paper |
Tolerant Testing of High-Dimensional Samplers with Subcube Conditioning
| 2023-08-08 | Paper |
On Scalable Testing of Samplers
| 2023-06-24 | Paper |
Projected model counting: beyond independent support
Automated Technology for Verification and Analysis | 2023-06-02 | Paper |
Efficient Learning of Interpretable Classification Rules
Journal of Artificial Intelligence Research | 2022-10-06 | Paper |
Counting minimal unsatisfiable subsets
| 2022-03-25 | Paper |
Leveraging GPUs for effective clause sharing in parallel SAT solving
| 2022-03-22 | Paper |
On the usefulness of linear modular arithmetic in constraint programming
| 2022-03-21 | Paper |
Classification rules in relaxed logical form
| 2021-07-06 | Paper |
Designing new phase selection heuristics
| 2021-04-07 | Paper |
On the sparsity of XORs in approximate model counting
| 2021-04-07 | Paper |
Approximate counting of minimal unsatisfiable subsets
| 2021-02-04 | Paper |
Tinted, detached, and lazy CNF-XOR solving and its applications to counting and sampling
| 2021-02-04 | Paper |
Sparse Hashing for Scalable Approximate Model Counting
Proceedings of the 35th Annual ACM/IEEE Symposium on Logic in Computer Science | 2021-01-21 | Paper |
On hashing-based approaches to approximate DNF-counting
| 2020-11-25 | Paper |
Scalable approximation of quantitative information flow in programs
Lecture Notes in Computer Science | 2020-07-07 | Paper |
Assessing heuristic machine learning explanations with model counting
| 2020-05-20 | Paper |
CrystalBall: gazing in the black box of SAT solving
| 2020-05-20 | Paper |
Not all FPRASs are equal: demystifying FPRASs for DNF-counting
Constraints | 2019-11-27 | Paper |
Knowledge compilation meets uniform sampling
EPiC Series in Computing | 2019-07-04 | Paper |
Design and verification of distributed phasers
| 2018-01-11 | Paper |
On computing minimal independent support and its applications to sampling and counting
Constraints | 2016-04-12 | Paper |
