Efficient Symmetry Breaking for Boolean Satisfiability
Abstract
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.
Cite
Text
Aloul et al. "Efficient Symmetry Breaking for Boolean Satisfiability." International Joint Conference on Artificial Intelligence, 2003. doi:10.1109/TC.2006.75Markdown
[Aloul et al. "Efficient Symmetry Breaking for Boolean Satisfiability." International Joint Conference on Artificial Intelligence, 2003.](https://mlanthology.org/ijcai/2003/aloul2003ijcai-efficient/) doi:10.1109/TC.2006.75BibTeX
@inproceedings{aloul2003ijcai-efficient,
title = {{Efficient Symmetry Breaking for Boolean Satisfiability}},
author = {Aloul, Fadi A. and Sakallah, Karem A. and Markov, Igor L.},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {2003},
pages = {271-276},
doi = {10.1109/TC.2006.75},
url = {https://mlanthology.org/ijcai/2003/aloul2003ijcai-efficient/}
}