Similar Items: Probabilistic-bit Guided CDCL for SAT Solving using Ising Consensus Assumptions
- Computing Short SAT Implicants via Ising/QUBO Encodings
- Efficient Incremental #SAT via Cross-Instance Knowledge Reuse
- Evidence-Tracked Tape Semantics for Probabilistic Computation
- Probabilistic Floating-Point Round-Off Analysis via Concentration Inequalities
- On Higher-Order Probabilistic Verification via the Weighted Relational Model of Linear Logic
- Verification of Neural Networks (Lecture Notes)