Research map / Probabilistic and scientific modeling / Variational and generative sampling
NSNet: A General Neural Probabilistic Framework for Satisfiability Problems
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Learning a SAT Solver from Single-Bit Supervision (ICLR 2019 · similarity 0.91)
- On the Expressive Power of GNNs for Boolean Satisfiability (ICLR 2026 · similarity 0.91)
- Learning Better Representations From Less Data For Propositional Satisfiability (NeurIPS 2024 · similarity 0.90)
- Learning How to Cube (NeurIPS 2026 · similarity 0.88)
- NeuroBack: Improving CDCL SAT Solving using Graph Neural Networks (ICLR 2024 · similarity 0.88)
- HardCore Generation: Generating Hard UNSAT Problems for Data Augmentation (NeurIPS 2024 · similarity 0.86)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.