Showing cs.LOShow all
2 papers · 1 filter
cs.LO2026
Orbitopal Fixing in SAT
Markus Anders, Cayden Codel, Marijn J. H. Heule
Despite their sophisticated heuristics, boolean satisfiability (SAT) solvers are still vulnerable to symmetry, causing them to visit search regions that are symmetric to ones alrea…
cs.LO2025
Certified Knowledge Compilation with Application to Formally Verified Model Counting
Randal E. Bryant, Wojciech Nawrocki, Jeremy Avigad +1
Computing many useful properties of Boolean formulas, such as their weighted or unweighted model count, is intractable on general representations. It can become tractable when form…