AI Paper Atlas

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

Hard Examples for Common Variable Decision Heuristics

Marc Vinyals

AAAI 2020 · Learning theory and algorithms › Combinatorial and search optimization · approach: SAT and model counting solvers · 18 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
embed Tseitin formula in pitfall formula Phi(45,6) vs standalone Ts(45)CaDiCaL (VMTF) · Phi(45,6)mean CPU time (s): 3331 -> 2228Improved
use CHB/Glucose/LRB on pitfall formula instead of standalone TseitinGlucose (VSIDS) · Phi(45,6) vs Ts(45)mean CPU time (s): 754 -> 1917Hurt
replace conflict-based heuristics with static variable order Y,X,Z,P,AGlucose · Phi(45,6)mean CPU time (s): 1917 -> < 1Improved
replace conflict-based heuristics with static variable orderGlucose · Phi(50,8)mean CPU time (s): 3600 -> < 1Improved
static order on standalone Tseitin formulaGlucose · Ts(45)mean CPU time (s): 754 -> 3600Hurt
interleave random decisions (probability about 0.2) with VSIDS (ablation)Glucose · pitfall formulasmean runtimeImproved
randomize variable polarities (initial phase) (ablation)CaDiCaL, Glucose, MapleSAT LRB · pitfall formulasruntimeMixed

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