Speeding up SAT solver by exploring CNF symmetries: Revisited

MaRDI QIDQ2995155zbMATH OpenFDO

Authors Arup Kumar Ghosh

Publication date 20 April 2011

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• CDCLSym: introducing effective symmetry breaking in SAT solving
• Improved static symmetry breaking for SAT
• \texttt{SymChaff}: Exploiting symmetry in a structure-aware satisfiability solver
• Symmetry Breaking for Maximum Satisfiability
• Expressing symmetry breaking in DRAT proofs

Cited in

(3)

• CDCLSym: introducing effective symmetry breaking in SAT solving
• Efficient symmetry breaking for SAT-based minimum DFA inference
• Reducing symmetries to generate easier SAT instances

Describes a project that uses

Uses Software

• BerkMin

This page was built for publication: Speeding up SAT solver by exploring CNF symmetries: Revisited

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2995155)