Symmetry Propagation: Improved Dynamic Symmetry Breaking in SAT

Jo Devriendt, Bart Bogaerts, Broes De Cat, Marc Denecker, Christopher Mears

2012 · 22 citations · 10 references

DOIFull text

Open access

Concepts

Abstract

For constraint programming, many well performing dynamic symmetry breaking techniques have been devised. For propositional satisfiability solving, dynamic symmetry breaking is still either slower or less general than static symmetry breaking. This paper presents Symmetry Propagation, which is an improvement to Lightweight Dynamic Symmetry Breaking, a dynamic symmetry breaking approach from CP. Symmetry Propagation uses any given symmetry as a propagator, and as a result is a general symmetry breaking technique. Experiments with an implementation in the SAT solver Minisat show that on many benchmarks, Symmetry Propagation outperforms the state-of-the-art static symmetry breaking method Shatter.

References

10