Symmetry Breaking in Quantified Boolean Formulae
Proceedings of the Twentieth International Joint Conference on Artificial Intelligence. Pages 2262-2266.
Abstract
Many reasoning task and combinatorial problems exhibit symmetries. Exploiting such symmetries has been proved to be very important in reducing search efforts. Breaking symmetries using additional constraints is currently one of the most used approaches. Extending such symmetry breaking techniques to quantified boolean formulae (QBF) is a very challenging task. In this paper, an approach to break symmetries in quantified boolean formulae is proposed. It makes an original use of universally quantified auxiliary variables to generate new symmetry breaking predicates and a new ordering of the QBF prefix is then computed leading to a new equivalent QBF formula with respect to validity. Experimental evaluation of the state-of-the-art QBF solver semprop shows significant improvements (up to several orders of magnitude) on many QBFs instances.
@inproceedings{ijcai2007p364,
title = {Symmetry Breaking in Quantified Boolean Formulae},
author = {Audemard, Gilles and Jabbour, Said and Sais, Lakhdar},
booktitle = {Proceedings of the Twentieth International Joint Conference on
Artificial Intelligence, {IJCAI-07}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Ramon López de Mántaras},
pages = {2262--2266},
year = {2007},
url = {https://ijcai.org/proceedings/2007/364},
}
TY - CPAPER TI - Symmetry Breaking in Quantified Boolean Formulae AU - Audemard, Gilles AU - Jabbour, Said AU - Sais, Lakhdar T2 - Proceedings of the Twentieth International Joint Conference on Artificial Intelligence, IJCAI-07 PB - International Joint Conferences on Artificial Intelligence PY - 2007 SP - 2262 EP - 2266 UR - https://ijcai.org/proceedings/2007/364 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
