atlas

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

Symmetric Component Caching for Model Counting on Combinatorial Instances

AAAI 2021 · Learning theory and algorithms › Combinatorial and search optimization · approach: SAT and model counting solvers · 3 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
Add symmetric component caching to GANAKGANAK · 212 combinatorial instancesPAR-2 score: 0.87× that of GANAKHelped
Add symmetric component caching to GANAKGANAK · 212 combinatorial instancesinstances solved: 16 more instancesHelped
Use symmetric component cachingGANAK · Instances solved by both countersaverage component size per cache hit: 58.2 -> 79.7Helped
Use symmetric component cachingGANAK · Instances solved by both countersmean decisions: 1.4 million -> 302 000Helped
Use VSADS variable selection instead of CSVSADS or ICSVSADS (ablation)SYMGANAK · 212 combinatorial instancesruntime: VSADS, CSVSADS and ICSVSADS was found to be the most effective heuristic in 34, 16 and 12 instances respectivelyMixed
Use ICSVSADS variable selection instead of CSVSADS (ablation)SYMGANAK · 212 combinatorial instancesruntime: same performanceNo clear effect
Use ICSVSADS variable selection instead of CSVSADS (ablation)SYMGANAK · 212 combinatorial instancesdecisions: 181 000 vs 149 000Helped

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