Research map / Learning theory and algorithms / Combinatorial and search optimization
Towards Generalization in QBF Solving via Machine Learning
Mikoláš Janota
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (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 decision-tree strategy learning every 64 iterations to RAReQS (QFUN-64) | RAReQS · QBF 2017 non-CNF | instances solved: 105 -> 111 | Improved |
| add strategy learning | RAReQS · QBF 2017 non-CNF | refinement iterations | Improved |
| learn every 16 vs 64 iterations (ablation) | QFUN · QBF 2017 non-CNF | instances solved: 110 vs 111 | No clear effect |
| learn every 128 vs 64 iterations (ablation) | QFUN · QBF 2017 non-CNF | instances solved: 111 vs 111 | No clear effect |
| accumulate previously learned strategies across rounds (ablation) | QFUN-64 · QBF 2017 non-CNF | instances solved: 104 -> 111 | Improved |
Closest papers by meaning
- Computationally Hard Problems Are Hard for QBF Proof Systems Too (AAAI 2025 · similarity 0.85)
- Proof Simulation via Round-based Strategy Extraction for QBF (AAAI 2025 · similarity 0.85)
- Runtime vs. Extracted Proof Size: An Exponential Gap for CDCL on QBFs (AAAI 2024 · similarity 0.83)
- FunBO: Discovering Acquisition Functions for Bayesian Optimization with FunSearch (ICML 2025 · similarity 0.82)
- Learning How to Cube (NeurIPS 2026 · similarity 0.82)
- Solving Higher-Order Quantified Boolean Satisfiability via Higher-Order Model Checking (AAAI 2025 · similarity 0.81)
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.
