Efficient Certified Reasoning for Binarized Neural Networks.
|
SAT |
2025 |
0 |
Explaining SAT Solving Using Causal Reasoning.
|
SAT |
2023 |
2 |
Algorithms Transcending the SAT-Symmetry Interface.
|
SAT |
2023 |
1 |
Engineering an Efficient Approximate DNF-Counter.
|
IJCAI |
2023 |
4 |
On Quantitative Testing of Samplers.
|
CP |
2022 |
2 |
Gaussian Elimination Meets Maximum Satisfiability.
|
KR |
2021 |
5 |
Leveraging GPUs for Effective Clause Sharing in Parallel SAT Solving.
|
SAT |
2021 |
10 |
GANAK: A Scalable Probabilistic Exact Model Counter.
|
IJCAI |
2019 |
108 |
BIRD: Engineering an Efficient CNF-XOR SAT Solver and Its Applications to Approximate Model Counting.
|
AAAI |
2019 |
129 |
CrystalBall: Gazing in the Black Box of SAT Solving.
|
SAT |
2019 |
19 |
Lynx: A Programmatic SAT Solver for the RNA-Folding Problem.
|
SAT |
2012 |
43 |
Extending SAT Solvers to Cryptographic Problems.
|
SAT |
2009 |
589 |