Certified Dominance and Symmetry Breaking for Combinatorial Optimisation

Bart Bogaerts, Stephan Gocht, Ciaran McCreesh, Jakob Nordström

Onderzoeksoutput: Articlepeer review

3 Downloads (Pure)

Samenvatting

Symmetry and dominance breaking can be crucial for solving hard combinatorial search and optimisation problems, but the correctness of these techniques sometimes relies on subtle arguments. For this reason, it is desirable to produce efficient, machine-verifiable certificates that solutions have been computed correctly. Building on the cutting planes proof system, we develop a certification method for optimisation problems in which symmetry and dominance breaking is easily expressible. Our experimental evaluation demonstrates that we can efficiently verify fully general symmetry breaking in Boolean satisfiability (SAT) solving, thus providing, for the first time, a unified method to certify a range of advanced SAT techniques that also includes cardinality and parity (XOR) reasoning. In addition, we apply our method to maximum clique solving and constraint programming as a proof of concept that the approach applies to a wider range of combinatorial problems.
Originele taal-2English
Pagina's (van-tot)1539-1589
Aantal pagina's51
TijdschriftJournal of Artificial Intelligence Research
Volume77
DOI's
StatusPublished - 2023

Vingerafdruk

Duik in de onderzoeksthema's van 'Certified Dominance and Symmetry Breaking for Combinatorial Optimisation'. Samen vormen ze een unieke vingerafdruk.

Citeer dit