atlas

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

Probabilistic Generalization of Backdoor Trees with Application to SAT

AAAI 2023 · Learning theory and algorithms › Combinatorial and search optimization · approach: Heuristic and local search algorithms · 2 citations (OpenAlex)

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 changedWhereMeasuredEffect
Use a ρ-backdoor tree found by the proposed search instead of solving the original formula directlySAT instances with Unit Propagation and Kissat · PvS7,4; BvP7,6; BvP8,4; BvS7,7; PHP13,12; par9; pmg12; sgen100decomposition rate: 0.62 ± 0.08; 0.85 ± 0.12; 0.87 ± 0.14; 0.99 ± 0.16; 0.55 ± 0.00; 0.65 ± 0.02; 0.12 ± 0.01; 0.29 ± 0.04Helped
Use a ρ-backdoor tree found by the proposed search instead of solving the original formula directlySAT instances with Unit Propagation and CaDiCaL · PvS7,4; BvP7,6; BvP8,4; BvS7,7; PHP13,12; par9; pmg12; sgen100decomposition rate: 0.68 ± 0.10; 0.72 ± 0.11; 0.71 ± 0.11; 0.78 ± 0.11; < 0.36 ± 0.04; 0.48 ± 0.04; 0.10 ± 0.01; 0.21 ± 0.03Helped
Replace probabilistic backdoor-set search with probabilistic backdoor-tree searchSAT decomposition search · SAT instances consideredbackdoor construction time: 3 s; 0.5–6 hHelped

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