AI Paper Atlas

Research map / Learning theory and algorithms / Combinatorial and search optimization

Towards Generalization in QBF Solving via Machine Learning

Mikoláš Janota

AAAI 2018 · Learning theory and algorithms › Combinatorial and search optimization · approach: Unsupervised neural combinatorial optimization · 37 citations (OpenAlex)

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 changedWhereMeasuredEffect
add decision-tree strategy learning every 64 iterations to RAReQS (QFUN-64)RAReQS · QBF 2017 non-CNFinstances solved: 105 -> 111Improved
add strategy learningRAReQS · QBF 2017 non-CNFrefinement iterationsImproved
learn every 16 vs 64 iterations (ablation)QFUN · QBF 2017 non-CNFinstances solved: 110 vs 111No clear effect
learn every 128 vs 64 iterations (ablation)QFUN · QBF 2017 non-CNFinstances solved: 111 vs 111No clear effect
accumulate previously learned strategies across rounds (ablation)QFUN-64 · QBF 2017 non-CNFinstances solved: 104 -> 111Improved

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy