Faster Certified Symmetry Breaking Using Orders With Auxiliary Variables
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , , , , , , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914165816295424 |
|---|---|
| author | Anders, Markus Bogaerts, Bart Bogø, Benjamin Gontier, Arthur Koops, Wietze McCreesh, Ciaran Myreen, Magnus O. Nordström, Jakob Oertel, Andy Rebola-Pardo, Adrian Tan, Yong Kiam |
| author_facet | Anders, Markus Bogaerts, Bart Bogø, Benjamin Gontier, Arthur Koops, Wietze McCreesh, Ciaran Myreen, Magnus O. Nordström, Jakob Oertel, Andy Rebola-Pardo, Adrian Tan, Yong Kiam |
| contents | Symmetry breaking is a crucial technique in modern combinatorial solving, but it is difficult to be sure it is implemented correctly. The most successful approach to deal with bugs is to make solvers certifying, so that they output not just a solution, but also a mathematical proof of correctness in a standard format, which can then be checked by a formally verified checker. This requires justifying symmetry reasoning within the proof, but developing efficient methods for this has remained a long-standing open challenge. A fully general approach was recently proposed by Bogaerts et al. (2023), but it relies on encoding lexicographic orders with big integers, which quickly becomes infeasible for large symmetries. In this work, we develop a method for instead encoding orders with auxiliary variables. We show that this leads to orders-of-magnitude speed-ups in both theory and practice by running experiments on proof logging and checking for SAT symmetry breaking using the state-of-the-art satsuma symmetry breaker and the VeriPB proof checking toolchain. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2511_16637 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Faster Certified Symmetry Breaking Using Orders With Auxiliary Variables Anders, Markus Bogaerts, Bart Bogø, Benjamin Gontier, Arthur Koops, Wietze McCreesh, Ciaran Myreen, Magnus O. Nordström, Jakob Oertel, Andy Rebola-Pardo, Adrian Tan, Yong Kiam Logic in Computer Science Artificial Intelligence Symmetry breaking is a crucial technique in modern combinatorial solving, but it is difficult to be sure it is implemented correctly. The most successful approach to deal with bugs is to make solvers certifying, so that they output not just a solution, but also a mathematical proof of correctness in a standard format, which can then be checked by a formally verified checker. This requires justifying symmetry reasoning within the proof, but developing efficient methods for this has remained a long-standing open challenge. A fully general approach was recently proposed by Bogaerts et al. (2023), but it relies on encoding lexicographic orders with big integers, which quickly becomes infeasible for large symmetries. In this work, we develop a method for instead encoding orders with auxiliary variables. We show that this leads to orders-of-magnitude speed-ups in both theory and practice by running experiments on proof logging and checking for SAT symmetry breaking using the state-of-the-art satsuma symmetry breaker and the VeriPB proof checking toolchain. |
| title | Faster Certified Symmetry Breaking Using Orders With Auxiliary Variables |
| topic | Logic in Computer Science Artificial Intelligence |
| url | https://arxiv.org/abs/2511.16637 |