CDCLSym: Introducing Effective Symmetry Breaking in SAT Solving

Abstract : SAT solvers are now widely used to solve a large variety of problems, including formal verification of systems. SAT problems derived from such applications often exhibit symmetry properties that could be exploited to speed up their solving. Static symmetry breaking is so far the most popular approach to take advantage of symmetries. It relies on a symmetry preprocessor which augments the initial problem with constraints that force the solver to consider only a few configurations among the many symmetric ones. This paper presents a new way to handle symmetries, that avoid the main problem of the current static approaches: the prohibitive cost of the preprocessing phase. Our proposal has been implemented in MiniSym. Extensive experiments on the benchmarks of last six SAT competitions show that our approach is competitive with the best state-of-the-art static symmetry breaking solutions.
Complete list of metadatas

Cited literature [20 references]  Display  Hide  Download

https://hal.sorbonne-universite.fr/hal-01766948
Contributor : Fabrice Kordon <>
Submitted on : Saturday, April 14, 2018 - 7:02:24 PM
Last modification on : Friday, July 5, 2019 - 3:26:03 PM

File

10.1007-978-3-319-89960-2_6.pd...
Publisher files allowed on an open archive

Identifiers

  • HAL Id : hal-01766948, version 1

Citation

Hakan Metin, Souheib Baarir, Maximilien Colange, Fabrice Kordon. CDCLSym: Introducing Effective Symmetry Breaking in SAT Solving. Tools and Algorithms for the Construction and Analysis of Systems -- TACAS, Apr 2018, Tessaloniki, Greece. ⟨hal-01766948⟩

Share

Metrics

Record views

230

Files downloads

131