Sciweavers

Share
IJCAI
2003

Efficient Symmetry Breaking for Boolean Satisfiability

11 years 1 months ago
Efficient Symmetry Breaking for Boolean Satisfiability
Identifying and breaking the symmetries of CNF formulae has been shown to lead to significant reductions in search times. In this paper we describe a more systematic and efficient construction of symmetry-breaking predicates (SBPs). In particular, we use the cycle structure of symmetry generators, which typically involve very few variables, to drastically reduce the size of SBPs. Furthermore, our new SBP construction grows linearly with the number of relevant variables as opposed to the previous quadratic constructions. Our empirical data suggest that these improvements reduce search run times by one to two orders of magnitude on a wide variety of benchmarks with symmetries.
Fadi A. Aloul, Karem A. Sakallah, Igor L. Markov
Added 31 Oct 2010
Updated 31 Oct 2010
Type Conference
Year 2003
Where IJCAI
Authors Fadi A. Aloul, Karem A. Sakallah, Igor L. Markov
Comments (0)
books