Efficient Symmetry Breaking for Boolean Satisfiability
Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence. Pages 271-275.
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.
@inproceedings{ijcai2003p40,
title = {Efficient Symmetry Breaking for Boolean Satisfiability},
author = {Aloul, Fadi A. and Sakallah, Karem A. and Markov, Igor L.},
booktitle = {Proceedings of the Eighteenth International Joint Conference on
Artificial Intelligence, {IJCAI-03}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Georg Gottlob},
pages = {271--275},
year = {2003},
url = {https://ijcai.org/proceedings/2003/40},
}
TY - CPAPER TI - Efficient Symmetry Breaking for Boolean Satisfiability AU - Aloul, Fadi A. AU - Sakallah, Karem A. AU - Markov, Igor L. T2 - Proceedings of the Eighteenth International Joint Conference on Artificial Intelligence, IJCAI-03 PB - International Joint Conferences on Artificial Intelligence PY - 2003 SP - 271 EP - 275 UR - https://ijcai.org/proceedings/2003/40 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
