Certified Symmetry and Dominance Breaking for Combinatorial Optimisation

03/23/2022
by   Bart Bogaerts, et al.
0

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 are 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 XOR and cardinality 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/28/2010

Symmetries of Symmetry Breaking Constraints

Symmetry is an important feature of many constraint programs. We show th...
research
09/25/2022

Certifying Parity Reasoning Efficiently Using Pseudo-Boolean Proofs

The dramatic improvements in combinatorial optimization algorithms over ...
research
06/14/2016

Lifted Convex Quadratic Programming

Symmetry is the essential element of lifted inference that has recently ...
research
02/16/2016

Symmetry Breaking Predicates for SAT-based DFA Identification

It was shown before that the NP-hard problem of deterministic finite aut...
research
09/04/2019

Fractals2019: Combinatorial Optimisation with Dynamic Constraint Annealing

Fractals2019 started as a new experimental entry in the RoboCup Soccer 2...
research
07/13/2021

Spontaneous Symmetry Breaking for Extreme Vorticity and Strain in the 3D Navier-Stokes Equations

We investigate the spatio-temporal structure of the most likely configur...
research
05/14/2022

Efficient lifting of symmetry breaking constraints for complex combinatorial problems

Many industrial applications require finding solutions to challenging co...

Please sign up or login with your details

Forgot password? Click here to reset