Composing Symmetry Propagation and Effective Symmetry Breaking for SAT Solving

Metin, Hakan; Baarir, Souheib; Kordon, Fabrice

doi:10.1007/978-3-030-20652-9_21

Cited by 4 publications

(2 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Symmetry handling has a long and successful history in SAT solving, with a wide variety of techniques considered by, e.g., Aloul, Sakallah, and Markov (2006), Benhamou and Saïs (1994), Benhamou, Nabhani, Ostrowski, and Saïdi (2010), Devriendt, Bogaerts, De Cat, Denecker, and Mears (2012), Devriendt, Bogaerts, and Bruynooghe (2017), Metin, Baarir, and Kordon (2019), and by Sabharwal (2009). These techniques were used to great effect in, e.g., the 2013 and 2016 editions of the SAT competition, 3 where the SAT+UNSAT hard combinatorial track and the no-limit track, respectively, were won by solvers employing symmetry breaking techniques.…”

Section: Certified Symmetry Breaking With Dominance-based Strengtheningmentioning

confidence: 99%

Certified Dominance and Symmetry Breaking for Combinatorial Optimisation

Bogaerts

Gocht²,

McCreesh³

et al. 2023

jair

View full text Add to dashboard Cite

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.

show abstract

Section: Certified Symmetry Breaking With Dominance-based Strengtheningmentioning

confidence: 99%

Certified Dominance and Symmetry Breaking for Combinatorial Optimisation

Bogaerts

Gocht²,

McCreesh³

et al. 2023

jair

View full text Add to dashboard Cite

show abstract

“…Symmetry handling has a long and successful history in SAT solving, with a wide variety of techniques considered by, e.g., Aloul, Sakallah, and Markov (2006); Benhamou and Saïs (1994); Benhamou et al (2010); Devriendt et al (2012); Devriendt, Bogaerts, and Bruynooghe (2017); Metin, Baarir, and Kordon (2019); Sabharwal (2009). These techniques were used to great effect in, e.g., the 2013 and 2016 editions of the SAT competition, 2 where the SAT+UNSAT hard combinatorial track and the no-limit track, respectively, were won by solvers employing symmetry breaking.…”

Section: Symmetry Breaking In Sat Solversmentioning

confidence: 99%

Certified Symmetry and Dominance Breaking for Combinatorial Optimisation

Bogaerts

Gocht

McCreesh

et al. 2022

AAAI

View full text Add to dashboard Cite

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.

show abstract