Research map / Learning theory and algorithms / Combinatorial and search optimization
Guiding CDCL SAT Search via Random Exploration amid Conflict Depression
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.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| add random exploration (expSAT) to gLCM | gLCM · Test Set 1 | instances solved: 372 -> 379 | Helped |
| add random exploration to MplCOMSPS | MplCOMSPS · Test Set 1 | instances solved: 412 -> 428 | Helped |
| add random exploration to MplCM | MplCM · Test Set 1 | instances solved: 442 -> 443 | No clear effect |
| add random exploration to MplCBT | MplCBT · Test Set 1 | instances solved: 442 -> 451 | Helped |
| add random exploration to gLCM | gLCM · Test Set 1 | PAR-2: 4133 -> 4068 | Helped |
| add random exploration to MplCOMSPS | MplCOMSPS · Test Set 2 | instances solved: 4 -> 13 | Helped |
| add random exploration to MplCBT | MplCBT · Test Set 2 | instances solved: 41 -> 43 | Helped |
| add random exploration to gLCM | gLCM · Test Set 2 | instances solved: 7 -> 12 | Helped |
| add paramAdapt adaptive parameters to eMplCOMSPS (ablation) | eMplCOMSPS · Test Set 1 | instances solved: 428 -> 417 | Hurt |
| add paramAdapt adaptive parameters to eGLCM (ablation) | eGLCM · Test Set 1 | instances solved: 379 -> 380 | No clear effect |
| add paramAdapt to eMplCOMSPS (ablation) | eMplCOMSPS · Test Set 2 | instances solved: 13 -> 29 | Helped |
| add paramAdapt to eGLCM (ablation) | eGLCM · Test Set 2 | instances solved: 12 -> 21 | Helped |
Closest papers by meaning
- Exponential Recency Weighted Average Branching Heuristic for SAT Solvers (AAAI 2016 · similarity 0.88)
- Runtime vs. Extracted Proof Size: An Exponential Gap for CDCL on QBFs (AAAI 2024 · similarity 0.87)
- NeuroBack: Improving CDCL SAT Solving using Graph Neural Networks (ICLR 2024 · similarity 0.85)
- Hardness of Random Reordered Encodings of Parity for Resolution and CDCL (AAAI 2024 · similarity 0.85)
- SATURN: SAT-based Reinforcement Learning to Unleash LLMs Reasoning (NeurIPS 2025 · similarity 0.84)
- SAT-Based Tree Decomposition with Iterative Cascading Policy Selection (AAAI 2024 · similarity 0.83)
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.