AI Paper Atlas

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

Model Counting for Dependency Quantified Boolean Formulas

Long-Hin Fung, Che Cheng, Jie-Hong Roland Jiang, Friedrich Slivovsky, Tony Tan

AAAI 2026 · Learning theory and algorithms › Combinatorial and search optimization · approach: SAT and model counting solvers · 0 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
count Skolem functions symbolically via BDD reachability and component decomposition instead of expanding to CNF2-DQBF model counting · 2-colorabilitylargest instance solved (bits): 12 -> 127Improved
use sharp2DQR instead of expansion plus Ganak2-DQBF model counting · PEC_opt (dependency sets 10 to 50)solved instances in 600 sImproved
use sharp2DQR instead of expansion plus Ganak2-DQBF model counting · PEC_small (dependency sets 3 to 10)solved instances in 600 sHurt
use sharp2DQR instead of expansion plus GanakFOMC independent-set counting · independent set counting instancessolving abilityHurt
use cryptominisat5 instead of z3 for expansion (ablation)Exp+ganak · PEC_optsolved instancesMixed

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